An approximate/exact objective based search technique for solving general scheduling problems.

Andrzej Kozik Radoslaw Rudek

Published in: Appl. Soft Comput. (2018)

Keyphrases

scheduling problem
exact solution
search algorithm
search efficiency
approximate matches
exact and approximate
special case
search space
search strategy
branch and bound search
graph coloring problems
exact computation
job shop scheduling
search heuristics
search procedure
processing times
web search
lower bound