Permutation vs. non-permutation flow shop schedules.

Chris N. Potts David B. Shmoys David P. Williamson

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

Keyphrases

scheduling problem
flowshop
single machine
tabu search
setup times
flowshop scheduling
processing times
np hard
asymptotic optimality
parallel machines
maximum lateness
special case
release dates
permutation flowshop
flowshop scheduling problems