A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria.
Jitti JungwattanakitManop ReodechaPaveena ChaovalitwongseFrank WernerPublished in: Comput. Oper. Res. (2009)
Keyphrases
- setup times
- unrelated parallel machines
- scheduling problem
- flowshop
- manufacturing cell
- scheduling algorithm
- multi item
- lot sizing
- sequence dependent setup times
- processing times
- single machine
- parallel machines
- precedence constraints
- lagrangian relaxation
- single machine scheduling problem
- special case
- strongly np hard
- single server
- np hard
- branch and bound algorithm
- optimization problems
- setup cost
- search algorithm
- tabu search
- multistage
- computational complexity