An experimental study of online scheduling algorithms
From MaRDI portal
Publication:5463426
DOI10.1145/944618.944621zbMath1083.68523OpenAlexW2096716071MaRDI QIDQ5463426
Susanne Albers, Bianca Schröder
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://www.jea.acm.org/2002/AlbersOnline/
Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
No-wait scheduling in single-hop multi-channel lans ⋮ Machine scheduling performance with maintenance and failure ⋮ An experimental study of new and known online packet buffering algorithms ⋮ Almost sure asymptotic optimality for online routing and machine scheduling problems ⋮ LP-based online scheduling: From single to parallel machines
This page was built for publication: An experimental study of online scheduling algorithms