Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-02-11
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
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.
American Psychological Association (APA)
Luo, Taibo& Xu, Yinfeng. 2014. Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-1050163
Modern Language Association (MLA)
Luo, Taibo& Xu, Yinfeng. Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time. The Scientific World Journal No. 2014 (2014), pp.1-6.
https://search.emarefa.net/detail/BIM-1050163
American Medical Association (AMA)
Luo, Taibo& Xu, Yinfeng. Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-1050163
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1050163
