Complexity results for flow-shop problems with a single server.

Peter Brucker Sigrid Knust Guoqing Wang

Published in: Eur. J. Oper. Res. (2005)

Keyphrases

scheduling problem
single server
setup times
flowshop
retrial queue
buffer allocation
flowshop scheduling
worst case
special case
state dependent
queueing networks
parallel machines
dynamic programming
tabu search
np complete
np hard
genetic algorithm
flowshop scheduling problems