Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates.

Wei-Wei Cui Zhiqiang Lu

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

Keyphrases

release dates
single machine
processing times
scheduling problem
minimize total
maximum lateness
release times

sequence dependent setup times
single machine scheduling problem
earliness tardiness
total weighted tardiness
scheduling jobs
identical parallel machines

weighted number of tardy jobs
setup times
parallel machines
job processing times
makespan minimization
precedence constraints

dynamic programming
flowshop
competitive ratio
branch and bound algorithm
optimal solution
number of late jobs