Speed Scaling for Maximum Lateness

DOI10.1007/978-3-642-32241-9_3zbMath1331.68036OpenAlexW1850884935MaRDI QIDQ2914308

Georgios Zois, Dimitrios Letsios, Ioannis Milis, Evripidis Bampis

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_3

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 (5)

Scheduling on a single machine under time-of-use electricity tariffs ⋮ Non-preemptive speed scaling ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

This page was built for publication: Speed Scaling for Maximum Lateness