Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/624
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Liu, Z | - |
dc.creator | Yuan, JJ | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:24:42Z | - |
dc.date.available | 2014-12-11T08:24:42Z | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/10397/624 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Operations Research Letters © 2002 Elsevier Science B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Batch processing | en_US |
dc.subject | Complexity | en_US |
dc.title | On scheduling an unbounded batch machine | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 42 | - |
dc.identifier.epage | 48 | - |
dc.identifier.volume | 31 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1016/S0167-6377(02)00186-4 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Operations research letters, Jan. 2003, v. 31, no. 1, p. 42-48 | - |
dcterms.isPartOf | Operations research letters | - |
dcterms.issued | 2003-01 | - |
dc.identifier.isi | WOS:000179885400007 | - |
dc.identifier.scopus | 2-s2.0-0037211738 | - |
dc.identifier.eissn | 1872-7468 | - |
dc.identifier.rosgroupid | r13318 | - |
dc.description.ros | 2002-2003 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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
196
Last Week
1
1
Last month
Citations as of Apr 21, 2024
Downloads
219
Citations as of Apr 21, 2024
SCOPUSTM
Citations
38
Last Week
0
0
Last month
0
0
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
41
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.