From preemptive to non-preemptive speed-scaling scheduling

DOI10.1016/J.DAM.2014.10.007zbMath1317.68021OpenAlexW2039509670MaRDI QIDQ479009

Ioannis Nemparis, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Alexander V. Kononov

Publication date: 5 December 2014

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

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

zbMATH Keywords

approximation algorithmsnon-preemptive schedulingspeed-scaling

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (7)

Scheduling on a single machine under time-of-use electricity tariffs ⋮ Energy-efficient scheduling and routing via randomized rounding ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Sustainable operations ⋮ Scheduling on power-heterogeneous processors ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Speed scaling of tasks with precedence constraints
• Non-preemptive Speed Scaling
• Speed Scaling for Maximum Lateness
• Speed Scaling on Parallel Processors with Migration
• Green Scheduling, Flows and Matchings
• Scheduling jobs that arrive over time
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

This page was built for publication: From preemptive to non-preemptive speed-scaling scheduling