Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/660
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorLin, BMT-
dc.date.accessioned2014-12-11T08:27:38Z-
dc.date.available2014-12-11T08:27:38Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/660-
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.subjectFlowshopen_US
dc.subjectMakespanen_US
dc.subjectJohnson's ruleen_US
dc.subjectComposite joben_US
dc.subjectRelocation problemen_US
dc.titleJohnson's rule, composite jobs and the relocation problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1008-
dc.identifier.epage1013-
dc.identifier.volume192-
dc.identifier.issue3-
dc.identifier.doi10.1016/j.ejor.2007.11.035-
dcterms.abstractTwo-machine flowshop scheduling to minimize makespan is one of the most well-known classical scheduling problems. Johnson's rule for solving this problem has been widely cited in the literature. We introduce in this paper the concept of composite job, which is an artificially constructed job with processing times such that it will incur the same amount of idle time on the second machine as that incurred by a chain of jobs in a given processing sequence. This concept due to Kurisu first appeared in 1976 to deal with the two-machine flowshop scheduling problem involving precedence constraints among the jobs. We show that this concept can be applied to reduce the computational time to solve some related scheduling problems. We also establish a link between solving the two-machine flowshop makespan minimization problem using Johnson's rule and the relocation problem introduced by Kaplan. We present an intuitive interpretation of Johnson's rule in the context of the relocation problem.-
dcterms.bibliographicCitationEuropean journal of operational research, 1 Feb. 2009, v. 192, no. 3, p. 1008-1013-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2009-02-01-
dc.identifier.isiWOS:000260242400025-
dc.identifier.scopus2-s2.0-51649107577-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr41882-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oapreprint_postprint-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
F2_Cmax_Final.pdfPre-published version143.88 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Full Text

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Aug 29, 2020

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Oct 28, 2020

Page view(s)

881
Last Week
1
Last month
Citations as of Oct 27, 2020

Download(s)

8,389
Citations as of Oct 27, 2020

Google ScholarTM

Check

Altmetric


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