. . "We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2,71 competitive randomized online algorithms. In addition, it matches the performance."@en . . . . "Optimal and online preemptive scheduling on uniformly related machines"@en . "[9A3C0432BF51]" . "We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2,71 competitive randomized online algorithms. In addition, it matches the performance." . "000189497100018" . "Montpellier" . . . "578155" . "Berlin" . . . "1"^^ . . "3-540-21236-1" . . "Optimal and online preemptive scheduling on uniformly related machines"@en . "Springer-Verlag" . . "2"^^ . "12"^^ . "P(GA201/01/1195), P(IAA1019401), P(LN00A056), P(ME 476), Z(AV0Z1019905)" . "Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)" . "Sgall, Ji\u0159\u00ED" . . "2004-03-25+01:00"^^ . "online scheduling; preemption; uniformly related machines"@en . "Optimal and online preemptive scheduling on uniformly related machines" . . . . "Optimal and online preemptive scheduling on uniformly related machines" . . . "RIV/67985840:_____/04:00106815!RIV10-MSM-67985840" . "RIV/67985840:_____/04:00106815" . . . "Ebenlendr, T." . .