Efficient enumeration of optimal and approximate solutions of a scheduling problem.

Sergey Sevastyanov Bertrand M. T. Lin

Published in: CTW (2011)

Keyphrases

approximate solutions
scheduling problem
np hard
optimal solution
worst case
single machine
dynamic programming
tabu search
exhaustive search
search space
permutation flowshop
setup times
precedence constraints
exact solution
approximation algorithms
energy function
graph cuts
genetic programming