An approximate solution of the flow-shop problem with sequence dependent setup times.
Wlodzimierz SzwarcJohn J. LiuPublished in: ZOR Methods Model. Oper. Res. (1989)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- total weighted tardiness
- special case
- maximum lateness
- setup times
- processing times
- total tardiness
- single machine
- tabu search
- parallel machines
- single machine scheduling problem
- np hard
- strongly np hard
- ant colony optimization
- precedence constraints
- job shop scheduling problem