| Article ID: | iaor2002691 |
| Country: | China |
| Volume: | 15A |
| Issue: | 3 |
| Start Page Number: | 326 |
| End Page Number: | 332 |
| Publication Date: | Sep 2000 |
| Journal: | Applied Mathematics (A Journal of Chinese Universities) |
| Authors: | He Yong, Min Xiao |
A version of two uniform processor scheduling with a special feature that the job may be rejected at a certain penalty is considered. When a job arrives, it can be scheduled or rejected for some penalty. The objective is to minimise the makespan of the schedule for accepted jobs plus the sum of penalties for rejected jobs. An algorithm is designed and its tight parametric worst-case bounded is given.