Approximation algorithms for energy-efficient scheduling of parallel jobs.
Alexander V. KononovYulia V. KovalenkoPublished in: J. Sched. (2020)
Keyphrases
- approximation algorithms
- energy efficient
- identical machines
- precedence constraints
- polynomial time approximation
- np hard
- wireless sensor networks
- parallel machines
- scheduling problem
- multi core architecture
- processing times
- open shop
- parallel processors
- batch processing machines
- vertex cover
- energy consumption
- special case
- sensor networks
- worst case
- energy efficiency
- single machine
- release dates
- base station
- setup times
- sequence dependent setup times
- approximation ratio
- single machine scheduling problem
- constant factor
- data dissemination
- routing algorithm
- computational complexity
- shared memory
- data transmission
- constant factor approximation
- data sets
- data center
- resource allocation
- optimal solution
- approximation guarantees
- communication networks
- strongly np hard
- branch and bound algorithm
- wireless networks
- lower bound