Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1069
Title: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
Authors: Cheng, TCE 
Ng, CTD 
Yuan, JJ
Keywords: Scheduling
Batching
Due-dates
Maximum lateness
Multi-operation jobs
Issue Date: Sep-2003
Publisher: Springer
Source: Journal of scheduling, Sept. 2003, v. 6, no. 5, p. 483-490 How to cite?
Journal: Journal of scheduling 
Abstract: In this paper, we consider the single machine batching problem with family setup times to minimize maximum lateness. While the problem was proved to be binary NP-hard in 1978, whether the problem is strongly NP-hard is a long-standing open question. We show that this problem is strongly NP-hard.
Description: Published article at http://dx.doi.org/10.1023/A:1024858623282
URI: http://hdl.handle.net/10397/1069
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1023/A:1024858623282
Rights: Journal of Scheduling © 2003 Kluwer Academic Publishers (Springer). The original publication is available at www.springerlink.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
multi_operation.pdfPre-published version162.19 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

SCOPUSTM   
Citations

18
Last Week
0
Last month
1
Citations as of Aug 13, 2018

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Aug 21, 2018

Page view(s)

397
Last Week
0
Last month
Citations as of Aug 14, 2018

Download(s)

236
Citations as of Aug 14, 2018

Google ScholarTM

Check

Altmetric


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