Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1267
Title: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Authors: Nong, QQ
Cheng, TCE 
Ng, CTD 
Keywords: On-line scheduling
Parallel machines
Batch
Worst-case analysis
Competitive ratio
Issue Date: Sep-2008
Publisher: Elsevier B.V.
Source: Operations research letters, Sept. 2008, v. 36, no. 5, p. 584-588 How to cite?
Journal: Operations research letters 
Abstract: We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. (See Article file for details of the abstract.)
URI: http://hdl.handle.net/10397/1267
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.03.004
Rights: Operations Research Letters © 2008 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
P2-batch-online.pdfPre-published version180.89 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

16
Last Week
1
Last month
0
Citations as of May 25, 2016

WEB OF SCIENCETM
Citations

13
Last Week
1
Last month
0
Citations as of May 19, 2016

Page view(s)

267
Last Week
4
Last month
Checked on May 22, 2016

Download(s)

507
Checked on May 22, 2016

Google ScholarTM

Check

Altmetric



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