. . . "[73F6EB46A812]" . "2"^^ . "1"^^ . . . "Sgall, J." . "10.1007/978-3-642-29116-6_9" . . "RIV/67985840:_____/12:00386905!RIV13-AV0-67985840" . . "7"^^ . "A lower bound on deterministic online algorithms for scheduling on related machines without preemption" . . . "RIV/67985840:_____/12:00386905" . "Heidelberg" . . . . . "A lower bound on deterministic online algorithms for scheduling on related machines without preemption"@en . "We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). 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 the previous work." . . . "120285" . "2011-09-08+02:00"^^ . "A lower bound on deterministic online algorithms for scheduling on related machines without preemption" . "We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). 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 the previous work."@en . . "Springer-Verlag" . "Saarbr\u00FCcken" . "Approximation and online algorithms" . "A lower bound on deterministic online algorithms for scheduling on related machines without preemption"@en . . "P(1M0545), P(IAA100190902), Z(AV0Z10190503)" . "algorithm analysis; problem complexity; computer science"@en . "Ebenlendr, Tom\u00E1\u0161" . "978-3-642-29115-9" . . . .