A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts

DOI10.1016/J.IPL.2008.03.003zbMath1186.68064OpenAlexW2120741360MaRDI QIDQ963457

Arundhati Bagchi Misra, Michael H. Goldwasser

Publication date: 19 April 2010

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

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

zbMATH Keywords

schedulinganalysis of algorithmson-line algorithmspreemption

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Admission control with immediate notification
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines

This page was built for publication: A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts