Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times.
BongJoo JeongYeong-Dae KimPublished in: Comput. Oper. Res. (2014)
Keyphrases
- minimizing total tardiness
- sequence dependent setup times
- flowshop
- scheduling problem
- single machine
- single machine scheduling problem
- parallel machines
- total weighted tardiness
- release dates
- maximum lateness
- lot sizing
- precedence constraints
- setup times
- special case
- processing times
- tabu search
- strongly np hard
- branch and bound algorithm
- setup cost
- np hard
- minimizing makespan
- dynamic programming
- multi item
- lower bound
- particle swarm optimization
- ant colony optimization