Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
Vadim G. TimkovskyPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- identical parallel machines
- scheduling problem
- fixed number
- processing times
- scheduling jobs
- release dates
- competitive ratio
- single machine
- parallel machines
- single server
- strongly np hard
- tabu search
- flowshop
- setup times
- simulated annealing
- worst case
- np hard
- average case
- precedence constraints
- special case
- search algorithm