Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > LOAD BALANCING:
TR00-001 | 14th January 2000
Piotr Berman, Moses Charikar, Marek Karpinski

#### On-Line Load Balancing for Related Machines

We consider the problem of scheduling permanent jobs on related machines
in an on-line fashion. We design a new algorithm that achieves the
competitive ratio of $3+\sqrt{8}\approx 5.828$ for the deterministic
version, and $3.31/\ln 2.155 \approx 4.311$ for its randomized variant,
improving the previous competitive ratios ... more >>>

ISSN 1433-8092 | Imprint