Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines

DOI10.1016/J.DAM.2014.05.023zbMath1298.90041OpenAlexW2082380676MaRDI QIDQ401128

Evripidis Bampis, Vincent Chau, Eric Angel

Publication date: 26 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.023

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 (5)

A survey of offline algorithms for energy minimization under deadline constraints ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ Scheduling with gaps: new models and algorithms

Cites Work

• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling unit tasks to minimize the number of idle periods

This page was built for publication: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines