Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times.
Ali AllahverdiTariq A. AldowaisanPublished in: J. Oper. Res. Soc. (2001)
Keyphrases
- scheduling problem
- flowshop
- processing times
- single machine
- flowshop scheduling
- total tardiness
- sequence dependent setup times
- minimizing makespan
- maximum lateness
- bicriteria
- np hard
- minimizing total tardiness
- precedence constraints
- setup times
- flowshop scheduling problems
- tabu search
- completion times
- release dates
- job shop scheduling problem
- parallel machines
- special case
- single machine scheduling problem
- strongly np hard
- neural network
- permutation flowshop
- robotic cell
- production system