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 |
Issue Date: | Oct-2009 | Source: | Computers and 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. | Keywords: | Scheduling Parallel-batch Rejection penalty Polynomial-time approximation scheme |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | 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 | Size | Format | |
---|---|---|---|---|
p-batch_with_C&OR.pdf | Pre-published version | 143.21 kB | Adobe PDF | View/Open |
Page views
171
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
251
Citations as of Apr 21, 2024
SCOPUSTM
Citations
56
Last Week
0
0
Last month
2
2
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
47
Last Week
0
0
Last month
1
1
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.