Journal
THEORETICAL COMPUTER SCIENCE
Volume 489, Issue -, Pages 58-66Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2013.04.013
Keywords
Scheduling; Uniform machine; Grade of service; Semi-online; Competitive ratio
Categories
Funding
- National Natural Science Foundation of China [11171106]
Ask authors/readers for more resources
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. (c) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
