IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i3p1008-1013.html
   My bibliography  Save this article

Johnson's rule, composite jobs and the relocation problem

Author

Listed:
  • Cheng, T.C.E.
  • Lin, B.M.T.

Abstract

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.

Suggested Citation

  • Cheng, T.C.E. & Lin, B.M.T., 2009. "Johnson's rule, composite jobs and the relocation problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 1008-1013, February.
    • Handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:1008-1013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01126-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kamburowski, J., 1997. "The nature of simplicity of Johnson's algorithm," Omega, Elsevier, vol. 25(5), pages 581-584, October.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    2. Yen-Shing Tsai & Bertrand M. T. Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    3. Ting-Chun Lo & Bertrand M. T. Lin, 2021. "Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations," Mathematics, MDPI, vol. 9(13), pages 1-35, June.
    4. Lin, B. M. T. & Cheng, T. C. E., 1999. "Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints," European Journal of Operational Research, Elsevier, vol. 116(1), pages 183-193, July.
    5. Yen-Shing Tsai & Bertrand Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    6. Edward H. Kaplan, 2021. "Perspectives on Policy Modeling: 2018 MSOM Fellow Award," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 267-273, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.