PolyU IR

PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >

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, 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.
Citation: 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.)
Description: 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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/1267
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
Locate publisher version via PolyU eLinks

Facebook Facebook del.icio.us del.icio.us LinkedIn LinkedIn

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.


© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback