An improved backtracking search algorithm for the flexible job shop rescheduling problem with new job insertions Online publication date: Wed, 01-Dec-2021
by Rylan H. Caldeira; A. Gnanavelbabu
European J. of Industrial Engineering (EJIE), Vol. 16, No. 1, 2022
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]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook