Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1069
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorNg, CTD-
dc.creatorYuan, JJ-
dc.date.accessioned2014-12-11T08:22:31Z-
dc.date.available2014-12-11T08:22:31Z-
dc.identifier.issn1094-6136-
dc.identifier.urihttp://hdl.handle.net/10397/1069-
dc.descriptionPublished article at http://dx.doi.org/10.1023/A:1024858623282en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rightsJournal of Scheduling © 2003 Kluwer Academic Publishers (Springer). The original publication is available at www.springerlink.com.en_US
dc.subjectSchedulingen_US
dc.subjectBatchingen_US
dc.subjectDue-datesen_US
dc.subjectMaximum latenessen_US
dc.subjectMulti-operation jobsen_US
dc.titleThe single machine batching problem with family setup times to minimize maximum lateness is strongly NP-harden_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.description.otherinformationAuthor name used in this publication: C. T. Ngen_US
dc.identifier.spage483-
dc.identifier.epage490-
dc.identifier.volume6-
dc.identifier.issue5-
dc.identifier.doi10.1023/A:1024858623282-
dcterms.abstractIn 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of scheduling, Sept. 2003, v. 6, no. 5, p. 483-490-
dcterms.isPartOfJournal of scheduling-
dcterms.issued2003-09-
dc.identifier.isiWOS:000221413100004-
dc.identifier.scopus2-s2.0-3543134230-
dc.identifier.eissn1099-1425-
dc.identifier.rosgroupidr19914-
dc.description.ros2003-2004 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
multi_operation.pdfPre-published version162.19 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

159
Last Week
1
Last month
Citations as of Aug 13, 2025

Downloads

172
Citations as of Aug 13, 2025

SCOPUSTM   
Citations

22
Last Week
0
Last month
1
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

22
Last Week
1
Last month
0
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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