IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v16y2022i1p41-70.html
   My bibliography  Save this article

An improved backtracking search algorithm for the flexible job shop rescheduling problem with new job insertions

Author

Listed:
  • Rylan H. Caldeira
  • A. Gnanavelbabu

Abstract

In real-world environments, production schedules are subject to several disruptions. Hence it is essential to account for these disruptions while constructing the production schedules. This work considers the flexible job-shop rescheduling problem (FJSRP) considering new job insertions. An improved discrete backtracking search algorithm and a slack-based inserting rescheduling strategy are proposed to address this problem considering makespan as objective. A set of heuristics is used to generate a diverse initial population. An order-preserving crossover and a mutation operator is developed to balance the exploitation and exploration. A transfer criterion is utilised to employ the information of the past population. The algorithm's exploitation capability is enhanced by employing a local search technique. Extensive computational work is performed on well-known benchmark instances. Computational results demonstrate the superiority of the proposed approach as well as the rescheduling strategy. [Received: 7 July 2020; Accepted: 27 January 2021]

Suggested Citation

  • Rylan H. Caldeira & A. Gnanavelbabu, 2022. "An improved backtracking search algorithm for the flexible job shop rescheduling problem with new job insertions," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 16(1), pages 41-70.
    • Handle: RePEc:ids:eujine:v:16:y:2022:i:1:p:41-70
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=119365
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:eujine:v:16:y:2022:i:1:p:41-70. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.