Flexible Job shop Scheduling with the Parallelized Cuckoo Search Optimisation algorithm

Abstract

Abstract A well-known combinatorial optimization problem known as the Flexible Job Shop Scheduling Problem (FJSP) often arises in engineering The complexity of the problem is complicated by the number of calculations required to find the optimal answer. In this work, we propose to use a parallel version of the Cuckoo Optimization Algorithm (COA) to solve the FJSP. Because parrots often lay their eggs in other birds’ nests, COA is a meta-heuristic optimization strategy. To increase speed, the proposed parallelized COA algorithm uses OpenMP to divide the computing workload among multiple processors. Benchmark examples taken from the literature are used to evaluate the performance of the proposed algorithm. The results show that, in terms of solution quality and computation time, the proposed method outperforms the current state-of-the-art methods