Solving no-wait job-shop scheduling problems using a multi-start simulated annealing with bi-directional shift timetabling algorithm

Abstract

This paper presents a multi-start simulated annealing with bi-directional shift timetabling (MSA-BST) algorithm for solving the no-wait jobshop scheduling problem (NWJSP). To enhance the quality of the solution, a bi-directional shift timetabling procedure that allows delay timetabling and consequently enlarges the search space is embedded into the multi-start simulated annealing algorithm. The performance of the proposed MSA-BST algorithm is evaluated with respect to the makespan by comparing its computational results to those of the best-to-date meta-heuristic algorithm, the hybrid artificial bee colony (HABC) algorithm, in the literature. Experimental results that were obtained by applying the proposed algorithm to a set of benchmark problems in the literature indicate that it significantly outperforms HABC. The main contribution of this study is to provide a novel and effective alternative method for solving the complex NWJSP.