@inbook {IOPORT.06056152,
    author       = {Ebenlendr, Tom\'a\v{s} and Sgall, Ji\v{r}{\'\i}},
    title        = {A lower bound on deterministic online algorithms for scheduling on related machines without preemption.},
    year         = {2012},
    booktitle    = {Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbr\"ucken, Germany, September 8--9, 2011. Revised selected papers},
    isbn         = {978-3-642-29115-9},
    pages        = {102-108},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-29116-6_9},
    abstract     = {Summary: We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). A previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer-based search through the graph of possible states of an algorithm in previous work.},
    identifier   = {06056152},
}