Semi-online Scheduling with GoS Eligibility Constraints
SCIE
SCOPUS
- Title
- Semi-online Scheduling with GoS Eligibility Constraints
- Authors
- Lee, K; Hwang, HC; Lim, K
- Date Issued
- 2014-07
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm. (C) 2014 Elsevier B.V. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/36370
- DOI
- 10.1016/J.IJPE.2014.03.001
- ISSN
- 0925-5273
- Article Type
- Article
- Citation
- INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, vol. 153, page. 204 - 214, 2014-07
- 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.