Speed-Scaling with No Preemptions
From MaRDI portal
Publication:2942634
DOI10.1007/978-3-319-13075-0_21zbMath1433.68064arXiv1407.7654OpenAlexW170424756MaRDI QIDQ2942634
Giorgio Lucarelli, Dimitrios Letsios, Evripidis Bampis
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.7654
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (7)
Energy-efficient scheduling and routing via randomized rounding ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Inverse interval scheduling via reduction on a single machine ⋮ Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints ⋮ Minimizing total completion time in multiprocessor job systems with energy constraint
This page was built for publication: Speed-Scaling with No Preemptions
