A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints
SCIE
SCOPUS
- Title
- A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints
- Authors
- Hwang, HC; Chang, SY; Hong, YS
- Date Issued
- 2004-03
- Publisher
- WORLD SCIENTIFIC PUBL CO PTE LTD
- Abstract
- We consider the on-line problem of scheduling n independent jobs on m identical machines under the machine eligibility constraints, where each job has its own specified subset of machines which are eligible for processing it. We investigate a greedy algorithm LS and prove its posterior competitiveness ratio is log(2) 4/lambdam - 1/lambda, where lambda is the number of machines eligible for processing the job with the latest completion time.
- Keywords
- on-line parallel machine scheduling; machine eligibility; competitive ratio; ONLINE
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/17953
- DOI
- 10.1142/S0217595904000084
- ISSN
- 0217-5959
- Article Type
- Article
- Citation
- ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, vol. 21, no. 1, page. 117 - 125, 2004-03
- 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.