An experimental study of online scheduling algorithms
From MaRDI portal
Publication:5463426
DOI10.1145/944618.944621zbMath1083.68523MaRDI 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/
68W40: Analysis of algorithms
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
No-wait scheduling in single-hop multi-channel lans, An experimental study of new and known online packet buffering algorithms, LP-based online scheduling: From single to parallel machines, Machine scheduling performance with maintenance and failure, Almost sure asymptotic optimality for online routing and machine scheduling problems