Minimizing total tardiness on a two-machine re-entrant flowshop.
Seong-Woo ChoiYeong-Dae KimPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- minimizing total tardiness
- flowshop
- scheduling problem
- sequence dependent setup times
- special case
- processing times
- single machine
- setup times
- flowshop scheduling
- bicriteria
- minimizing makespan
- parallel machines
- tabu search
- np hard
- single machine scheduling problem
- preventive maintenance
- strongly np hard
- precedence constraints
- identical parallel machines
- computational complexity
- lot sizing
- simulated annealing
- ant colony optimization