On-Line Load Balancing for Related Machines

Piotr Berman, Moses Charikar, Marek Karpinski

    Research output: Contribution to journalArticlepeer-review

    61 Scopus citations


    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 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2e ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.

    Original languageEnglish (US)
    Pages (from-to)108-121
    Number of pages14
    JournalJournal of Algorithms
    Issue number1
    StatePublished - Apr 2000

    All Science Journal Classification (ASJC) codes

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics


    Dive into the research topics of 'On-Line Load Balancing for Related Machines'. Together they form a unique fingerprint.

    Cite this