A scatter search algorithm for scheduling optimisation of job shop problems

Abstract

The Job Shop Scheduling (JSS) problem is one of the most difficult NP-hard combinatorial optimisation problems. it is very difficult to solve by conventional optimisation techniques. There has been increasing interest in applying metaheuristic methods to solve such hard optimisation problems. In this work, a novel metaheuristic approach called Scatter Search (SS) is applied for the JSS problem, an NP-hard sequencing problem. The approach is used to find a schedule to minimise the makespan (Cmax), that is, the time required to complete all jobs. SS contrasts with other evolutionary procedures by providing a wide exploration of the search space through intensification and diversification. In addition, it has a unifying principle for joining solutions. It exploits the adaptive memory principle to avoid generating or incorporating duplicate solutions at various stages of the problem. The main aim of this research is to explore the potential of SS for scheduling JSS problems. SS provides unifying principles for joining solutions based on generalised path constructions and by utilising strategic designs where other approaches resort to randomisation. In this paper, 11 benchmark problems are taken from the literature. The results available for the various existing metaheuristic methods for the selected benchmark problems are compared with results obtained by the SS method. The proposed framework achieves better results for all 11 problems.