Randomized on-line scheduling on two uni
β
Leah Epstein; John Noga; Steve Seiden; JiΕΓ Sgall; Gerhard Woeginger
π
Article
π
2001
π
Springer US
π
English
β 178 KB
We study the problem of on-line scheduling on two uniform machines with speeds 1 and s\*1. A +1.61803 competitive deterministic algorithm was already known. We present the "rst randomized results for this problem: We show that randomization does not help for speeds s\*2, but does help for all s(2. W