A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption

Tomás Ebenlendr, Jiri Sgall. A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. In Roberto Solis-Oba, Giuseppe Persiano, editors, Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Volume 7164 of Lecture Notes in Computer Science, pages 102-108, Springer, 2011. [doi]

Abstract

Abstract is missing.