The complexity of customer order scheduling problems on parallel machines.

Published in: Comput. Oper. Res. (2005)

Keyphrases

parallel machines
scheduling problem
total tardiness
earliness tardiness
np hard
single machine
sequence dependent setup times
unrelated parallel machines
image segmentation
flowshop
precedence constraints
computational complexity
worst case
higher order
tabu search
minimize total