What is Monkey Search Algorithm

This work proposes a hybrid monkey search algorithm (HMSA) to solve the flexible job shop scheduling problem (FJSP) to minimize the makespan. The FJSP is a simple scheduling model that resembles numerous industrial production processes and the FJSP has been proved to be strongly NP-hard. Due to both theoretical and practical significance of FJSP, numerous researchers tackled the FJSP using different approaches. In this paper, the variable neighbourhood search (VNS) algorithm is combined with the monkey search algorithm (MSA) to enhance the solution quality. Benchmark problems are considered for validating the performance of the proposed algorithm. The computational results confirm the supremacy of the proposed HMSA for the benchmark problem.