Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines

DOI10.1007/978-3-642-29344-3_2zbMath1297.90028OpenAlexW1959227897MaRDI QIDQ2894449

Vincent Chau, Evripidis Bampis, Eric Angel

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_2

zbMATH Keywords

schedulingpower managementidentical processorsunit tasks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A survey of offline algorithms for energy minimization under deadline constraints ⋮ Scheduling with Gaps: New Models and Algorithms ⋮ A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace ⋮ Scheduling with gaps: new models and algorithms

This page was built for publication: Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines