A note on multiprocessor speed scaling with precedence constraints.
Evripidis BampisDimitrios LetsiosGiorgio LucarelliPublished in: SPAA (2014)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- vertex cover
- single machine scheduling problem
- approximation algorithms
- parallel processors
- parallel machines
- partial order
- maximum lateness
- partially ordered
- global constraints
- sequence dependent setup times
- unit length
- setup times
- release dates
- series parallel
- partially ordered sets
- lower bound
- processing times
- single machine
- simulated annealing
- np hard