Temperature aware online algorithms for scheduling equal length jobs

DOI10.1016/j.tcs.2012.02.003zbMath1358.68324OpenAlexW1991856073MaRDI QIDQ388098

Stanley P. Y. Fung, Martin Birks

Publication date: 19 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.003

zbMATH Keywords

schedulingtemperatureonline algorithmslower boundsthroughput

Mathematics Subject Classification ID

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

Related Items (3)

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Temperature aware online algorithms for minimizing flow time

Cites Work

• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
• Speed scaling to manage energy and temperature
• Temperature Aware Online Scheduling with a Low Cooling Factor
• Online Scheduling with Hard Deadlines
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Unnamed Item

This page was built for publication: Temperature aware online algorithms for scheduling equal length jobs