The flow shop problem with no-idle constraints: A review and approximation.
Yaroslav GoncharovSergey SevastyanovPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- flowshop
- scheduling problem
- processing times
- setup times
- lot streaming
- approximation algorithms
- precedence constraints
- special case
- flowshop scheduling
- flowshop scheduling problems
- tabu search
- job shop
- manufacturing cell
- maximum lateness
- global constraints
- open shop
- unrelated parallel machines
- neural network
- single machine
- production system
- resource constraints
- sequence dependent setup times
- asymptotic optimality
- constraint programming
- multistage
- minimizing makespan
- sufficient conditions
- np hard
- genetic algorithm