A modified cuckoo search algorithm for flow shop scheduling problem with blocking

This paper presents a Modified Cuckoo Search (MCS) algorithm for solving flow shop scheduling problem with blocking to minimize the makespan. To handle the discrete variables of the job scheduling problem, the smallest position value (SPV) rule is used to convert continuous solutions into discrete job permutations. The Nawaz-Enscore-Ham (NEH) heuristic method is utilized for generating high quality initial solutions. Moreover, two frequently used swap and insert operators are employed for enhancing the local search. To verify the performance of the proposed MCS algorithm, experiments are conducted on Taillard´s benchmark set. Results show that MCS performs better than the standard CS and some previous algorithms proposed in the literature.