A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints.

Published in: Optim. Lett. (2012)

Keyphrases

polynomial time approximation
approximation algorithms
np hard
error bounds
vertex cover
bin packing
scheduling problem
constraint satisfaction
special case
identical machines
worst case
approximation ratio
evolutionary algorithm
combinatorial optimization
constraint programming
constrained optimization