A new average case analysis for completion time scheduling
From MaRDI portal
Publication:5901052
DOI10.1145/509907.509936zbMath1192.90080OpenAlexW2074756264MaRDI QIDQ5901052
Mark Scharbrodt, Angelika Steger, Thomas Schickinger
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509936
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Embracing the giant component ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Efficient job scheduling algorithms with multi-type contentions
This page was built for publication: A new average case analysis for completion time scheduling