Parallel machine scheduling under a grade of service provision
SCIE
SCOPUS
- Title
- Parallel machine scheduling under a grade of service provision
- Authors
- Hwang, HC; Chang, SY; Lee, K
- Date Issued
- 2004-10
- Publisher
- PERGAMON-ELSEVIER SCIENCE LTD
- Abstract
- We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance. (C) 2003 Elsevier Ltd. All rights reserved.
- Keywords
- parallel machine scheduling; longest processing time first; eligibility; grade of service
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/17848
- DOI
- 10.1016/S0305-0548(03)00164-3
- ISSN
- 0305-0548
- Article Type
- Article
- Citation
- COMPUTERS & OPERATIONS RESEARCH, vol. 31, no. 12, page. 2055 - 2061, 2004-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.