Cuckoo search optimization for job shop scheduling problem

Abstract

In this paper, a novel hybrid algorithm incorporating the cuckoo search optimization (CSO) technique and an Assorted Individual Enhancement Scheme is proposed to solve the ob shop scheduling problem (JSSP) with an objective to minimize the makespan. The proposed hybrid algorithm is applied to 20 job shop problem instances available in OR-Library and the results are compared with simple CSO. Analysis suggests that the hybrid approach is more effective and robust toward JSSP than simple CSO technique.