| Article ID: | iaor20023224 |
| Country: | China |
| Volume: | 16 |
| Issue: | 2 |
| Start Page Number: | 111 |
| End Page Number: | 115 |
| Publication Date: | Apr 2001 |
| Journal: | Journal of Systems Engineering and Electronics |
| Authors: | Zhao Chuanli, Tang Hengyong, Zhang Qingling |
In this paper we discuss the nonpreemptive uniform processors scheduling problem with ready time. We improve the bound of the longest processing time first (LPT) schedule for the general case. A bound of LPT dependent on processor speed for m=2 is given.