Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
DOI10.1007/S10479-011-0957-5zbMATH Open1296.90057OpenAlexW2007207220MaRDI QIDQ744652FDOQ744652
Authors: Rafał Różycki, Jan Węglarz 
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0957-5
Recommendations
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- On a certain class of power- and energy-related scheduling problems
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Power-aware scheduling for makespan and flow
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling for Speed Bounded Processors
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
- STACS 2005
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
- Title not available (Why is that?)
- Lexicographic ordering, ranking and unranking of combinations
- Approximation and Online Algorithms
Cited In (9)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Title not available (Why is that?)
- Revenue sharing for resource transfer among projects
- Comparative analysis of some metaheuristics for discrete-continuous project scheduling with activities of identical processing rates
- Power aware scheduling on variable speed processor: limits of the theoretical model
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
- On a certain class of power- and energy-related scheduling problems
- Power and performance management for parallel computations in clouds and data centers
Uses Software
This page was built for publication: Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744652)
