Minimizing makespan in three-machine flow shops with deteriorating jobs.
Ji-Bo WangMing-Zheng WangPublished in: Comput. Oper. Res. (2013)
Keyphrases
- minimizing makespan
- deteriorating jobs
- maximum tardiness
- scheduling problem
- flowshop
- maximum lateness
- single machine
- parallel machines
- setup times
- tabu search
- processing times
- np hard
- scheduling jobs
- special case
- linear program
- sequence dependent setup times
- strongly np hard
- simulated annealing
- release times
- dynamic programming
- cost function