Journal
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA
Volume 10, Issue 4, Pages 689-702Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s40305-020-00325-6
Keywords
Online scheduling; Parallel machines; A grade of service provision; GoS
Categories
Funding
- National Natural Science Foundation of China [11271356, 71390334]
Ask authors/readers for more resources
This paper investigates online scheduling problems with different service levels on two parallel identical machines, with makespan as the objective function. Three different versions of the problem are considered, and optimal online algorithms with different competitive ratios are proposed for each version.
In this paper, we investigate online scheduling problems on two parallel identical machines under a grade of service provision with makespan as the objective function. The jobs arrive over time and each job can be scheduled only when it has already been arrived. We consider three different versions: (i) the two machines cannot be idle at the same time until all arrived jobs have been processed; (ii) further to the first problem, jobs are processed on a first-come, first-serviced basis; (iii) each job must be assigned to one of the two machines as soon as it arrives. Respectively for three online scheduling problems, optimal online algorithms are proposed with competitive ratio (root 5 + 1)/2, (root 5 + 1)/2 and 5/3.
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