IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i20p6908-6922.html
   My bibliography  Save this article

Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits

Author

Listed:
  • Hyeon-Il Kim
  • Dong-Ho Lee

Abstract

This study addresses a multi-stage flow shop scheduling problem in which a job is reworked when its queue time between two arbitrary stages exceeds an upper limit. The problem is to determine the start times of jobs and rework setups/operations if incurred for the objective of minimising makespan. As an extension of the previous studies, multiple overlapped queue time limits are considered, i.e. some in-between stages of queue time limits for a job are overlapped. A mixed integer programming model is developed and its performance is reported for small-sized test instances. Then, due to the limited applications of optimal solution approaches, a variable neighbourhood search (VNS) algorithm is proposed that generates an initial solution and improves it using a shaking and a local search improvement methods. In addition, it is extended to the general variable neighbourhood search (GVNS) algorithms with variable neighbourhood descent (VND) methods. Computational results show that the GVNS algorithms outperform the VNS algorithm significantly and also give near optimal solutions for small-sized test instances within a reasonable amount of computation times.

Suggested Citation

  • Hyeon-Il Kim & Dong-Ho Lee, 2023. "Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits," International Journal of Production Research, Taylor & Francis Journals, vol. 61(20), pages 6908-6922, October.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:20:p:6908-6922
    DOI: 10.1080/00207543.2022.2139004
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2139004
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2139004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:61:y:2023:i:20:p:6908-6922. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.