Online Scheduling Revisited

  • Rudolf Fleischer
  • Michaela Wahl
Conference paper

DOI: 10.1007/3-540-45253-2_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1879)
Cite this paper as:
Fleischer R., Wahl M. (2000) Online Scheduling Revisited. In: Paterson M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Rudolf Fleischer
    • 1
  • Michaela Wahl
    • 2
  1. 1.Department of Computer ScienceUniversity of WaterlooUK
  2. 2.Max-Planck-Institut für InformatikSaarbrücken

Personalised recommendations