Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1306
Title: Bounded single-machine parallel-batch scheduling with release dates and rejection
Authors: Lu, L
Cheng, TCE 
Yuan, J
Zhang, L
Keywords: Scheduling
Parallel-batch
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 How to cite?
Journal: Computers & operations research 
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.
URI: http://hdl.handle.net/10397/1306
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.12.003
Rights: Computers & Operations Research © 2009 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
p-batch_with_C&OR.pdfPre-published version143.21 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

29
Last Week
0
Last month
2
Citations as of Jun 5, 2016

WEB OF SCIENCETM
Citations

25
Last Week
0
Last month
1
Citations as of Aug 23, 2016

Page view(s)

461
Last Week
0
Last month
Checked on Aug 28, 2016

Download(s)

741
Checked on Aug 28, 2016

Google ScholarTM

Check

Altmetric



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