Please use this identifier to cite or link to this item:
Title: On-line Scheduling for jobs with arbitrary release times
Authors: Li, R. 
Huang, H.-C. 
Keywords: List scheduling
On-line scheduling
Worst-case performance
Issue Date: 2004
Citation: Li, R.,Huang, H.-C. (2004). On-line Scheduling for jobs with arbitrary release times. Computing (Vienna/New York) 73 (1) : 79-97. ScholarBank@NUS Repository.
Abstract: This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time on m parallel identical machines. A tight bound is given for List Scheduling(LS) algorithm and a better algorithm is given for m ≥ 2.
Source Title: Computing (Vienna/New York)
ISSN: 0010485X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jun 23, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.