| Article ID: | iaor20011326 |
| Country: | Netherlands |
| Volume: | 23 |
| Issue: | 3/5 |
| Start Page Number: | 113 |
| End Page Number: | 116 |
| Publication Date: | Oct 1998 |
| Journal: | Operations Research Letters |
| Authors: | Wen J.J. |
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s greater than or equal to 1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of