Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/87129
DC FieldValue
dc.titleOn-line Scheduling for jobs with arbitrary release times
dc.contributor.authorLi, R.
dc.contributor.authorHuang, H.-C.
dc.date.accessioned2014-10-07T10:24:35Z
dc.date.available2014-10-07T10:24:35Z
dc.date.issued2004
dc.identifier.citationLi, 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.
dc.identifier.issn0010485X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/87129
dc.description.abstractThis 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.
dc.sourceScopus
dc.subjectList scheduling
dc.subjectOn-line scheduling
dc.subjectWorst-case performance
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleComputing (Vienna/New York)
dc.description.volume73
dc.description.issue1
dc.description.page79-97
dc.description.codenCMPTA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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