An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times.

Janny May-Yee Leung Eugene Levner

Published in: Oper. Res. Lett. (2006)

Keyphrases

processing times
worst case performance ratio
worst case
dynamic programming
single machine scheduling problem
scheduling problem
computational complexity
cyclic scheduling
learning algorithm
optimal solution
lower bound
search space
np hard
competitive ratio