標題: Johnson's rule, composite jobs and the relocation problem
作者: Cheng, T. C. E.
Lin, B. M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: Flowshop;Makespan;Johnson's rule;Composite job;Relocation problem
公開日期: 1-Feb-2009
摘要: Two-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.
URI: http://dx.doi.org/10.1016/j.ejor.2007.11.035
http://hdl.handle.net/11536/7693
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.11.035
期刊: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume: 192
Issue: 3
起始頁: 1008
結束頁: 1013
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.