Polynomial Time Algorithms for Minimum Energy Scheduling

DOI10.1007/978-3-540-75520-3_14zbMath1151.68338OpenAlexW2490992636MaRDI QIDQ3527206

Philippe Baptiste, Marek Chrobak, Christoph Dürr

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2535/

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

A greedy approximation algorithm for minimum-gap scheduling ⋮ Scheduling with Gaps: New Models and Algorithms ⋮ Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Speed scaling on parallel processors ⋮ A model for minimizing active processor time ⋮ On the NP-hardness of speed scaling with sleep state ⋮ A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace ⋮ Scheduling with gaps: new models and algorithms ⋮ Unnamed Item ⋮ Online dynamic power management with hard real-time guarantees

This page was built for publication: Polynomial Time Algorithms for Minimum Energy Scheduling