Chapter

Algorithms - ESA 2000

Volume 1879 of the series Lecture Notes in Computer Science pp 202-210

Date:

Online Scheduling Revisited

  • Rudolf FleischerAffiliated withDepartment of Computer Science, University of Waterloo
  • , Michaela WahlAffiliated withMax-Planck-Institut für Informatik

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a new online algorithm, MR, for non-preemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m ≥ 64. For m → ∞ its competitive ratio approaches 1 + \( \sqrt {\frac{{1 + 1n{\mathbf{ }}2}} {2}} \) > 1.9201.