Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higher GoS level, knowing the total pro...

Full description

Saved in:
Bibliographic Details
Published inTheScientificWorld Vol. 2014; no. 2014; pp. 1 - 6
Main Authors Luo, Taibo, Xu, Yinfeng
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2014
John Wiley & Sons, Inc
Wiley
Subjects
Algorithms
Heuristic
Industrial equipment
Methods
Models, Theoretical
Properties
Scheduling (Management)
Scheduling algorithms
Online AccessGet full text

Cover

More Information
Summary:This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higher GoS level, knowing the total processing time of the jobs with lower GoS level, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of 3/2, 20/13, and 4/3 which are shown to be optimal.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Academic Editors: J. G. Barbosa and D. Oron
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2014/576234