Graph balancing: a special case of scheduling unrelated parallel machines.
Tomás EbenlendrMarek KrcálJirí SgallPublished in: SODA (2008)
Keyphrases
- unrelated parallel machines
- special case
- scheduling problem
- parallel machines
- flowshop
- setup times
- np hard
- open shop
- approximation algorithms
- scheduling jobs
- processing times
- single server
- computational complexity
- single machine
- sequence dependent setup times
- precedence constraints
- job shop
- graph model
- tabu search
- completion times
- job shop scheduling
- multi item
- genetic algorithm
- parallel computing