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

DOI10.1016/j.ejor.2011.10.017zbMath1244.90101MaRDI 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

deadlines; preemptable jobs; non-linear programming; power-aware computing; ready times

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

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, Scheduling shared continuous resources on many-cores, 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, 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, On a certain class of power- and energy-related scheduling problems, Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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