Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
Peter BruckerSigrid KnustT. C. Edwin ChengNatalia V. ShakhlevichPublished in: Ann. Oper. Res. (2004)
Keyphrases
- open shop
- flowshop
- scheduling problem
- job shop
- unrelated parallel machines
- processing times
- setup times
- job shop scheduling
- tabu search
- sequence dependent setup times
- parallel machines
- np hard
- single machine
- maximum lateness
- worst case
- special case
- completion times
- job shop scheduling problem
- resource constrained
- production scheduling
- computational complexity
- lot streaming
- precedence constraints
- multistage
- metaheuristic
- simulated annealing
- evolutionary algorithm