Discrete Cuckoo Search algorithm for job shop scheduling problem

This paper presents an application of Discrete Cuckoo Search (DCS) algorithm for solving the Job Shop Scheduling Problem (JSSP), one of the most difficult NP-hard combinatorial optimization problems. DCS is recently developed by Ouaarab et al. in 2013, based on Cuckoo Search (CS), proposed by Yang and Deb in 2009. DCS performs its search via Lévy flights by proposing three different steps to move in the search space. It applies a search balance between local and global random walk. The performance of DCS is tested on a set of benchmarks of JSSP from the OR-Library. The test results are compared with a Particle Swarm Optimization (PSO) algorithm and they showed that DCS outperforms PSO.