Three is easy, two is hard: open shop sum-batch scheduling problem refined.
Irina V. GribkovskaiaChung-Yee LeeVitaly A. StrusevichDominique de WerraPublished in: Oper. Res. Lett. (2006)
Keyphrases
- open shop
- completion times
- scheduling problem
- job shop
- single machine
- flowshop
- unrelated parallel machines
- weighted sum
- processing times
- parallel machines
- single machine scheduling problem
- tabu search
- job shop scheduling
- np hard
- precedence constraints
- job shop scheduling problem
- setup times
- special case
- lower bound
- production scheduling