Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/87035
DC FieldValue
dc.titleImproved algorithm for a generalized on-line scheduling problem on identical machines
dc.contributor.authorLi, R.
dc.contributor.authorHuang, H.-C.
dc.date.accessioned2014-10-07T10:23:31Z
dc.date.available2014-10-07T10:23:31Z
dc.date.issued2007-01-01
dc.identifier.citationLi, R., Huang, H.-C. (2007-01-01). Improved algorithm for a generalized on-line scheduling problem on identical machines. European Journal of Operational Research 176 (1) : 643-652. ScholarBank@NUS Repository.
dc.identifier.issn03772217
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/87035
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. In this problem, jobs arrive in form of order before its release time and decisions have to be made whenever an order is placed and the orders arrive according to any sequence. A heuristic algorithm, NMLS, better than MLS is given for any m ≥ 2. The competitive ratio is improved from 2.93920 to 2.78436. © 2005 Elsevier B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.ejor.2005.06.061
dc.sourceScopus
dc.subjectCompetitive ratio
dc.subjectHeuristic
dc.subjectList scheduling
dc.subjectOn-line
dc.subjectScheduling
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.sourcetitleEuropean Journal of Operational Research
dc.description.volume176
dc.description.issue1
dc.description.page643-652
dc.description.codenEJORD
dc.identifier.isiut000241709600045
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.