SPT is optimally competitive for uniprocessor flow

Authors:
David P. Bunde
Affiliations:
University of Illinois at Urbana-Champaign, Department of Computer Science, 201 N. Goodwin Ave., Urbana, IL
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 0

Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Minimizing the flow time without migration

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine

SIAM Journal on Computing

Quantified Score

Hi-index	0.89

Visualization

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.