| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436789 | Theoretical Computer Science | 2013 | 9 Pages |
Abstract
This paper studies the semi-online scheduling on two uniform machines under a grade of service (GoS) provision, where one machine is available for all jobs and the other one is only available for partial jobs. The objective is to minimize the makespan. We consider three variants, where the optimal makespan, the total size of jobs, and the largest job size are known in advance respectively, and design optimal algorithms for all of them.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
