Approximation algorithms for flexible job shop problems.

Klaus Jansen Monaldo Mastrolilli Roberto Solis-Oba

Published in: Int. J. Found. Comput. Sci. (2005)

Keyphrases

approximation algorithms
open shop
job shop
vertex cover
np hard
approximation schemes
job shop scheduling
randomized algorithms
special case
production scheduling
primal dual
multistage
worst case
minimum cost
integer programming
benchmark problems
lightweight
low cost
evolutionary algorithm