A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
From MaRDI portal
Publication:2896382
DOI10.1007/978-3-642-29116-6_9zbMath1242.68377OpenAlexW92055354MaRDI QIDQ2896382
Publication date: 16 July 2012
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_9
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum ⋮ Lower bounds for online makespan minimization on a small number of related machines ⋮ Online Scheduling on a CPU-GPU Cluster
This page was built for publication: A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
