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 
Keywords: Scheduling
Batch processing
Complexity
Issue Date: Jan-2003
Publisher: Elsevier Science B.V.
Source: Operations research letters, Jan. 2003, v. 31, no. 1, p. 42-48 How to cite?
Journal: Operations research letters 
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.
URI: http://hdl.handle.net/10397/624
ISSN: 0167-6377
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 SizeFormat 
batch.pdfPre-published version123.89 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

29
Last Week
0
Last month
0
Citations as of May 25, 2016

WEB OF SCIENCETM
Citations

31
Last Week
0
Last month
0
Citations as of May 19, 2016

Page view(s)

348
Last Week
5
Last month
Checked on May 22, 2016

Download(s)

502
Checked on May 22, 2016

Google ScholarTM

Check

Altmetric



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