Johnson's rule, composite jobs and the relocation problem
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 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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- E H Kaplan, 1986. "Relocation models for public housing redevelopment programs," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 13(1), pages 5-19, January.
- Kamburowski, J., 1997. "The nature of simplicity of Johnson's algorithm," Omega, Elsevier, vol. 25(5), pages 581-584, October.
- Kaplan, Edward H. & Amir, Amihood, 1988. "A fast feasibility test for relocation problems," European Journal of Operational Research, Elsevier, vol. 35(2), pages 201-206, May.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:1008-1013. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.