Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines

DOI10.1145/509907.509929zbMATH Open1192.68277OpenAlexW2049808834MaRDI QIDQ3579201FDOQ3579201

Spyros Kontogiannis

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.509929

Mathematics Subject Classification ID

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

Cited In (1)

• Efficient job scheduling algorithms with multi-type contentions

This page was built for publication: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines

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