A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time.

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

Keyphrases

flowshop
scheduling problem
processing times
minimize total
single machine
special case
tabu search
scheduling decisions
data sets
class labels
total cost
finite number
precedence constraints
single machine scheduling problem
identical parallel machines