Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines.
Rafal RózyckiJan WeglarzPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- parallel processors
- precedence constraints
- job scheduling
- processing times
- contract algorithms
- scheduling problem
- identical machines
- release dates
- branch and bound algorithm
- single processor
- parallel machines
- single machine
- maximum lateness
- setup times
- single machine scheduling problem
- search problems
- approximation algorithms
- response time
- minimize total
- identical parallel machines
- flowshop
- partially ordered
- unrelated parallel machines
- np hard
- grid environment
- global constraints
- scheduling policies
- genetic algorithm
- combinatorial optimization
- release times
- upper bound
- lower bound