| Article ID: | iaor20013922 |
| Country: | China |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 77 |
| End Page Number: | 84 |
| Publication Date: | Mar 2000 |
| Journal: | Journal of Mathematical Study |
| Authors: | Lu Haiyan |
The problem of scheduling of jobs with similar processing time on kernelled multi-processor systems is presented in this paper. The accurate bounds of ratio of the LPT solution to the optimal solution are obtained and the bounds are proved to be exact for some cases.