New results on competitive analysis of online SRPT scheduling

DOI10.1007/978-981-16-6890-6_73zbMath1498.90098OpenAlexW4226112547MaRDI QIDQ2080035

Rakesh Mohanty, Sheetal Swain, Debasis Dwibedy

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_73

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New algorithms for an ancient scheduling problem.
• Online algorithms: a survey
• On-line scheduling revisited
• Amortized Computational Complexity
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Better Bounds for Online Scheduling
• Scheduling jobs that arrive over time
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: New results on competitive analysis of online SRPT scheduling