Back to Search
Start Over
Semi-online scheduling problems on two uniform machines under a grade of service provision.
- Source :
-
Theoretical Computer Science . Jun2013, Vol. 489-490, p58-66. 9p. - Publication Year :
- 2013
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 489-490
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 89276729
- Full Text :
- https://doi.org/10.1016/j.tcs.2013.04.013