| Article ID: | iaor20117399 |
| Volume: | 39 |
| Issue: | 4 |
| Start Page Number: | 255 |
| End Page Number: | 259 |
| Publication Date: | Jul 2011 |
| Journal: | Operations Research Letters |
| Authors: | Schwiegelshohn Uwe |
| Keywords: | programming: mathematical |
Kawaguchi and Kyan proved a worst case ratio for Largest‐Ratio‐First scheduling. The original proof is rather long and involved. We provide an alternative proof by showing sets of simple worst case instances.