How to Schedule When You Have to Buy Your Energy

DOI10.1007/978-3-642-15369-3_27zbMath1306.90059OpenAlexW1568902948MaRDI QIDQ3588420

Kirk R. Pruhs, Clifford Stein

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_27

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ A general framework for handling commitment in online throughput maximization ⋮ DVS scheduling in a line or a star network of processors

This page was built for publication: How to Schedule When You Have to Buy Your Energy