An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule

Authors:
Uwe Schwiegelshohn
Affiliations:
-
Venue:
Operations Research Letters
Year:
2011

Citing 2
Cited 0

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Structure of a simple scheduling polyhedron

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a well-known paper from 1986, Kawaguchi and Kyan proved that the Largest-Ratio-First rule for total weighted completion time scheduling on identical parallel machines has a worst case ratio of 12(1+2). We provide an alternative and simple proof for this result.