Total completion time with makespan constraint in no-wait flowshops with setup times.
Ali AllahverdiHarun AydilekPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- setup times
- scheduling problem
- flowshop
- processing times
- minimizing makespan
- total tardiness
- single machine
- total weighted tardiness
- strongly np hard
- unrelated parallel machines
- completion times
- sequence dependent setup times
- parallel machines
- special case
- scheduling jobs
- single machine scheduling problem
- precedence constraints
- tabu search
- permutation flowshop
- manufacturing cell
- np hard
- release dates
- bicriteria
- open shop
- multi item
- evolutionary algorithm
- lot sizing
- job shop
- genetic algorithm