Please use this identifier to cite or link to this item:
Title: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
Authors: Nong, Q. Q.
Ng, Chi-to Daniel
Cheng, T. C. Edwin
Subjects: Single-machine scheduling
Worst-case analysis
Approximation algorithm
Issue Date: Jan-2008
Publisher: Elsevier
Source: Operations research letters, Jan. 2008, v. 36, no. 1, p. 61-66.
Abstract: We consider the problem of scheduling family jobs with release dates on a bounded batching machine to minimize the makespan. A polynomial-time approximation scheme for the identical job size model and an approximation algorithm with a worst-case ratio of 5/2 for the non-identical job size model will be derived.
Rights: Operations Research Letters © 2007 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.orl.2007.01.007
ISSN: 0167-6377
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
PTAS-family-batch.pdfPre-published version185.67 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.