Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan.
Rafal RózyckiJan WeglarzPublished in: Ann. Oper. Res. (2014)
Keyphrases
- parallel processors
- precedence constraints
- job scheduling
- processing times
- scheduling problem
- release dates
- identical machines
- single processor
- parallel machines
- maximum lateness
- branch and bound algorithm
- single machine
- single machine scheduling problem
- setup times
- scheduling jobs
- approximation algorithms
- identical parallel machines
- search problems
- partially ordered
- flowshop
- np hard
- minimize total
- partial order
- unrelated parallel machines
- global constraints
- release times
- contract algorithms
- batch processing machines
- deteriorating jobs
- search algorithm
- scheduling decisions
- computational grids
- resource allocation
- data structure
- reinforcement learning