Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines.
Tomás EbenlendrMarek KrcálJirí SgallPublished in: Algorithmica (2014)
Keyphrases
- unrelated parallel machines
- special case
- scheduling problem
- parallel machines
- flowshop
- np hard
- setup times
- scheduling jobs
- sequence dependent setup times
- computational complexity
- open shop
- approximation algorithms
- processing times
- tabu search
- single machine
- job shop scheduling problem
- precedence constraints
- lower bound
- optimal solution
- job shop
- scheduling algorithm
- branch and bound algorithm