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
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
EISSN: 1872-7468
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
PIRA download icon_1.1View/Download Contents

Google ScholarTM

Check

Altmetric


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