On-line scheduling with hard deadlines

DOI10.1007/3-540-63307-3_65zbMath1497.68580OpenAlexW1561683176MaRDI QIDQ5096944

Sally A. Goldman, Jyoti Parwatikar, Subhash Suri

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_65

Mathematics Subject Classification ID

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

Related Items (1)

Online deadline scheduling on faster machines.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• On the power of randomization in on-line algorithms
• Efficient On-Line Call Control Algorithms
• An optimal on-line algorithm for metrical task system

This page was built for publication: On-line scheduling with hard deadlines