Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption

DOI10.1016/j.dam.2014.08.001zbMath1329.68053arXiv1805.11297OpenAlexW2135548260MaRDI QIDQ499333

Oscar C. Vásquez, Łukasz Jeż, Christoph Dürr

Publication date: 30 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.11297

zbMATH Keywords

optimizationschedulingquality of servicemechanism designenergy management

Mathematics Subject Classification ID

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

Related Items (6)

The local-global conjecture for scheduling with non-linear cost ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ On Submodular Search and Machine Scheduling ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
• Speed scaling to manage energy and temperature
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Optimal Allocation of Public Goods: A Solution to the "Free Rider" Problem
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg
• Dual Techniques for Scheduling on a Machine with Varying Speed

This page was built for publication: Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption