Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

DOI10.1016/j.ejor.2011.10.017zbMath1244.90101OpenAlexW2093424995MaRDI QIDQ439457

Jan Weglarz, Rafal Rózycki

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.017

zbMATH Keywords

deadlinespreemptable jobsnon-linear programmingpower-aware computingready times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Scheduling shared continuous resources on many-cores ⋮ Energy-efficient scheduling in manufacturing companies: a review and research framework ⋮ Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource ⋮ Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Simple matching vs linear assignment in scheduling models with positional effects: a critical review ⋮ 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 ⋮ Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms ⋮ A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

Cites Work

• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Scheduling for Speed Bounded Processors
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines