Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ejor.2005.06.061
Title: Improved algorithm for a generalized on-line scheduling problem on identical machines
Authors: Li, R.
Huang, H.-C. 
Keywords: Competitive ratio
Heuristic
List scheduling
On-line
Scheduling
Issue Date: 1-Jan-2007
Source: Li, 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. https://doi.org/10.1016/j.ejor.2005.06.061
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. 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.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/87035
ISSN: 03772217
DOI: 10.1016/j.ejor.2005.06.061
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

3
checked on Feb 13, 2018

WEB OF SCIENCETM
Citations

2
checked on Feb 13, 2018

Page view(s)

17
checked on Feb 20, 2018

Google ScholarTM

Check

Altmetric


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