Login / Signup
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times.
Xiao-Yuan Wang
Ming-Zheng Wang
Ji-Bo Wang
Published in:
Comput. Ind. Eng. (2011)
Keyphrases
</>
job processing times
flowshop
scheduling problem
processing times
single machine
makespan minimization
release dates
special case
setup times
sequence dependent setup times
tabu search
np hard
parallel machines
precedence constraints
job shop
total weighted tardiness
polynomially solvable
memetic algorithm