SPT is optimally competitive for uniprocessor flow

DOI10.1016/J.IPL.2004.02.013zbMath1178.68688OpenAlexW1981555806MaRDI QIDQ2390257

David P. Bunde

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.02.013

zbMATH Keywords

algorithmsschedulingon-line algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (1)

From Preemptive to Non-preemptive Scheduling Using Rejections

Cites Work

• Minimizing the flow time without migration
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SPT is optimally competitive for uniprocessor flow