SPT is optimally competitive for uniprocessor flow

https://doi.org/10.1016/j.ipl.2004.02.013Get rights and content

Abstract

We show that the Shortest Processing Time (SPT) algorithm is (Δ+1)/2-competitive for nonpreemptive uniprocessor total flow time with release dates, where Δ is the ratio between the longest and shortest job lengths. This is best possible for a deterministic algorithm and improves on the (Δ+1)-competitive ratio shown by Epstein and van Stee using different methods.

References (7)

  • B. Awerbuch et al.

    Minimizing flow time without migration

  • L. Epstein et al.

    Lower bounds for on-line single-machine scheduling

  • L. Epstein et al.

    Optimal on-line flow time with resource augmentation

There are more references available in the full text version of this article.

Cited by (4)

1

Partially supported by NSF grant CCR-0093348 and Sandia National Laboratories. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under Contract DE-AC04-94AL85000.

View full text
Copyright © 2004 Elsevier B.V. All rights reserved.