Please use this identifier to cite or link to this item:
Title: Bounded single-machine parallel-batch scheduling with release dates and rejection
Authors: Lu, Lingfa
Cheng, T. C. Edwin
Yuan, Jinjiang
Zhang, Liqi
Subjects: Scheduling
Rejection penalty
Polynomial-time approximation scheme
Issue Date: Oct-2009
Publisher: Elsevier
Source: Computers & operations research, Oct. 2009, v. 36, no. 10, p. 2748-2751.
Abstract: We consider the bounded single-machine parallel-batch scheduling problem with release dates and rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and then processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. When the jobs have identical release dates, we present a polynomial-time algorithm. When the jobs have a constant number of release dates, we give a pseudo-polynomial-time algorithm. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.
Rights: Computers & Operations Research © 2009 Elsevier Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.cor.2008.12.003
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
p-batch_with_C&OR.pdfPre-published version143.21 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.