Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
From MaRDI portal
Publication:3579201
DOI10.1145/509907.509929zbMath1192.68277OpenAlexW2049808834MaRDI QIDQ3579201
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
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 (1)
This page was built for publication: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
