Approximating the Throughput by Coolest First Scheduling

DOI10.1007/978-3-642-38016-7_16zbMath1395.68069OpenAlexW148627563MaRDI QIDQ2848925

Julien Robert, Georgios Zois, Ioannis Milis, Christoph Dürr

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_16

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Temperature aware online algorithms for minimizing flow time

This page was built for publication: Approximating the Throughput by Coolest First Scheduling