An experimental study of online scheduling algorithms

DOI10.1145/944618.944621MaRDI QIDQ5463426zbMATH OpenOpenAlexFDO

Authors 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/

zbMATH Keywords

experimentationonline algorithmsperformancescheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1982174
• scientific article; zbMATH DE number 1670659
• Experimental analysis of online algorithms for the bicriteria scheduling problem
• scientific article; zbMATH DE number 1003243
• Extending Graham's result on scheduling to other heuristics

Cited in

(10)

• LP-based online scheduling: From single to parallel machines
• Experimental analysis of online algorithms for the bicriteria scheduling problem
• Machine scheduling performance with maintenance and failure
• Almost sure asymptotic optimality for online routing and machine scheduling problems
• On the Robustness of Graham’s Algorithm for Online Scheduling
• scientific article; zbMATH DE number 1982174 (Why is no real title available?)
• On robust online scheduling algorithms
• Greedy scheduling with custom-made objectives
• No-wait scheduling in single-hop multi-channel lans
• An experimental study of new and known online packet buffering algorithms

This page was built for publication: An experimental study of online scheduling algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463426)