Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times.
Chen-Yang ChengKuo-Ching YingShu-Fen LiYa-Chu HsiehPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- minimizing makespan
- sequence dependent setup times
- scheduling problem
- flowshop
- parallel machines
- single machine
- total weighted tardiness
- total flowtime
- total tardiness
- setup times
- precedence constraints
- release dates
- processing times
- special case
- tabu search
- np hard
- permutation flowshop
- job shop
- single machine scheduling problem
- strongly np hard
- objective function