A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.

Qi Wei Erfang Shan Liying Kang

Published in: Theor. Comput. Sci. (2014)

Keyphrases

flowshop
scheduling problem
worst case
processing times
special case
tabu search
parallel machines
asymptotic optimality
optimization problems
setup times
neural network
computational complexity
hybrid algorithm
asymptotically optimal
minimizing makespan
buffer allocation