Login / Signup
Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines.
Chun-Lung Chen
Chuen-Lung Chen
Published in:
Comput. Ind. Eng. (2009)
Keyphrases
</>
minimize total
parallel machines
unrelated parallel machines
scheduling problem
single machine
release dates
scheduling jobs
setup times
sequence dependent setup times
precedence constraints
shared memory
parallel computing
search algorithm
processing times
single server
flowshop
total cost