Makespan minimization in open shops: A polynomial time approximation scheme.

Sergey V. Sevastianov Gerhard J. Woeginger

Published in: Math. Program. (1998)

Keyphrases

polynomial time approximation
makespan minimization
np hard
approximation algorithms
error bounds
bin packing
special case
worst case
integer programming