Greedy minimum-energy scheduling
From MaRDI portal
Cites work
- A fully polynomial-time approximation scheme for speed scaling with sleep state
- A greedy approximation algorithm for minimum-gap scheduling
- Algorithms for energy conservation in heterogeneous data centers
- Greedy minimum-energy scheduling
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2079319 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 7788624 (Why is no real title available?)
- Improving the bounds of the online dynamic power management problem
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
- Online dynamic power management with hard real-time guarantees
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Machine Scheduling to Minimize Energy Consumption
- Polynomial Time Algorithms for Minimum Energy Scheduling
- Race to idle: new algorithms for speed scaling with a sleep state
- Scheduling unit tasks to minimize the number of idle periods
- Scheduling with gaps: new models and algorithms
This page was built for publication: Greedy minimum-energy scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940316)