Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/624
Title: | On scheduling an unbounded batch machine | Authors: | Liu, Z Yuan, JJ Cheng, TCE |
Issue Date: | Jan-2003 | Source: | Operations research letters, Jan. 2003, v. 31, no. 1, p. 42-48 | Abstract: | A batch machine is a machine that can process up to c jobs simultaneously as a batch, and the processing time of the batch is equal to the longest processing time of the jobs assigned to it. In this paper, we deal with the complexity of scheduling an unbounded batch machine, i.e., c=+∞. We prove that minimizing total tardiness is binary NP-hard, which has been an open problem in the literature. Also, we establish the pseudopolynomial solvability of the unbounded batch machine scheduling problem with job release dates and any regular objective. This is distinct from the bounded batch machine and the classical single machine scheduling problems, most of which with different release dates are unary NP-hard. Combined with the existing results, this paper provides a nearly complete mapping of the complexity of scheduling an unbounded batch machine. | Keywords: | Scheduling Batch processing Complexity |
Publisher: | Elsevier | Journal: | Operations research letters | ISSN: | 0167-6377 | EISSN: | 1872-7468 | DOI: | 10.1016/S0167-6377(02)00186-4 | Rights: | Operations Research Letters © 2002 Elsevier Science B.V. 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 | |
---|---|---|---|---|
batch.pdf | Pre-published version | 123.89 kB | Adobe PDF | View/Open |
Page views
193
Last Week
1
1
Last month
Citations as of Mar 24, 2024
Downloads
216
Citations as of Mar 24, 2024
SCOPUSTM
Citations
38
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
41
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.