Speed scaling for maximum lateness

DOI10.1007/S00224-015-9622-8zbMath1336.68019OpenAlexW2085119474MaRDI QIDQ255271

Ioannis Milis, Georgios Zois, Dimitrios Letsios, Evripidis Bampis

Publication date: 9 March 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9622-8

zbMATH Keywords

schedulingenergy efficiencymaximum latenessspeed scaling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Speed scaling of tasks with precedence constraints
• Power-aware scheduling for makespan and flow
• Speed Scaling for Weighted Flow Time
• Speed is as powerful as clairvoyance
• Scheduling Parallel Machines On-Line
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg

This page was built for publication: Speed scaling for maximum lateness