Please use this identifier to cite or link to this item:
Title: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Authors: Nong, Q. Q.
Cheng, T. C. Edwin
Ng, Chi-to Daniel
Subjects: On-line scheduling
Parallel machines
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.
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.)
Rights: Operations Research Letters © 2008 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.orl.2008.03.004
ISSN: 0167-6377
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
P2-batch-online.pdfPre-published version180.89 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.