Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheng, T. C. E.en_US
dc.contributor.authorLin, B. M. T.en_US
dc.date.accessioned2014-12-08T15:10:05Z-
dc.date.available2014-12-08T15:10:05Z-
dc.date.issued2009-02-01en_US
dc.identifier.issn0377-2217en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ejor.2007.11.035en_US
dc.identifier.urihttp://hdl.handle.net/11536/7693-
dc.description.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 oil 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. (c) 2007 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_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.typeArticleen_US
dc.identifier.doi10.1016/j.ejor.2007.11.035en_US
dc.identifier.journalEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.citation.volume192en_US
dc.citation.issue3en_US
dc.citation.spage1008en_US
dc.citation.epage1013en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000260242400025-
dc.citation.woscount4-
Appears in Collections:Articles


Files in This Item:

  1. 000260242400025.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.