On the Interplay between Global DVFS and Scheduling Tasks with Precedence Constraints.
Marco E. T. GerardsJohann L. HurinkJan KuperPublished in: IEEE Trans. Computers (2015)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- maximum lateness
- sequence dependent setup times
- vertex cover
- partial order
- single machine scheduling problem
- series parallel
- setup times
- approximation algorithms
- global constraints
- np hard
- single machine
- partially ordered
- unit length
- flowshop
- branch and bound
- identical machines
- lower bound
- optimal solution
- genetic algorithm
- multi dimensional
- special case