Semi-online Scheduling Problems on a Small Number of Machines
SCIE
SCOPUS
- Title
- Semi-online Scheduling Problems on a Small Number of Machines
- Authors
- Lee, K; Lim, K
- Date Issued
- 2013-10
- Publisher
- SPRINGER
- Abstract
- We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/36372
- DOI
- 10.1007/S10951-013-0329-X
- ISSN
- 1094-6136
- Article Type
- Article
- Citation
- JOURNAL OF SCHEDULING, vol. 16, no. 5, page. 461 - 477, 2013-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.