Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan

DOI10.1007/s10479-011-0957-5zbMath1296.90057OpenAlexW2007207220MaRDI QIDQ744652

Jan Weglarz, Rafal Rózycki

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

zbMATH Keywords

makespan minimizationpreemptable jobspower-aware computingjob model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates ⋮ On a certain class of power- and energy-related scheduling problems ⋮ 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 ⋮ Revenue sharing for resource transfer among projects

Uses Software

• CFSQP

Cites Work

• Unnamed Item
• An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Scheduling for Speed Bounded Processors
• Lexicographic ordering, ranking and unranking of combinations
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• STACS 2005
• Approximation and Online Algorithms