Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine.
Ju-Yong LeeYeong-Dae KimPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- minimizing total tardiness
- scheduling problem
- flowshop
- sequence dependent setup times
- single machine
- processing times
- setup times
- np hard
- bicriteria
- minimizing makespan
- flowshop scheduling
- total tardiness
- tabu search
- unrelated parallel machines
- parallel machines
- special case
- makespan minimization
- permutation flowshop
- total weighted tardiness
- preventive maintenance
- precedence constraints
- identical parallel machines
- maximum lateness
- total flowtime
- search algorithm