Complexity of preemptive minsum scheduling on unrelated parallel machines.
René SittersPublished in: J. Algorithms (2005)
Keyphrases
- unrelated parallel machines
- scheduling problem
- parallel machines
- setup times
- np hard
- min sum
- single machine
- flowshop
- job shop scheduling
- processing times
- scheduling algorithm
- tabu search
- precedence constraints
- job shop
- worst case
- job shop scheduling problem
- scheduling jobs
- open shop
- computational complexity
- lower bound
- genetic algorithm
- parallel computing
- multi objective