Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1262
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:24:00Z-
dc.date.available2014-12-11T08:24:00Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/1262-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectSingle machineen_US
dc.subjectMulti-operation jobsen_US
dc.subjectJob-batch restrictionen_US
dc.subjectSPT-agreeabilityen_US
dc.titleSingle-machine scheduling of multi-operation jobs without missing operations to minimize the total completion timeen_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.spage320-
dc.identifier.epage331-
dc.identifier.volume191-
dc.identifier.issue2-
dc.identifier.doi10.1016/j.ejor.2007.08.019-
dcterms.abstractWe consider the problem of scheduling multi-operation jobs on a singe machine to minimize the total completion time. Each job consists of several operations that belong to different families. In a schedule each family of job operations may be processed as batches with each batch incurring a set-up time. A job is completed when all of its operations have been processed. We first show that the problem is strongly NP-hard even when the set-up times are common and each operation is not missing. When the operations have identical processing times and either the maximum set-up time is sufficiently small or the minimum set-up time is sufficiently large, the problem can be solved in polynomial time. We then consider the problem under the job-batch restriction in which the operations of each batch is partitioned into operation batches according to a partition of the jobs. We show that this case of the problem can be solved in polynomial time under a certain condition.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 1 Dec. 2008, v. 191, no. 2, p. 320-331-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2008-12-01-
dc.identifier.isiWOS:000257343900003-
dc.identifier.scopus2-s2.0-43849093288-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr38473-
dc.description.ros2007-2008 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Assembly_without(REVISED)_Final.pdfPre-published version178.31 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

78
Last Week
1
Last month
Citations as of Jul 3, 2022

Downloads

141
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Jul 7, 2022

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Jul 7, 2022

Google ScholarTM

Check

Altmetric


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