Research on the Cuckoo Algorithm for Flexible Workshop Scheduling Problems

Abstract

As a typical combinatorial optimization problem, the essence of the solution to the scheduling problem is to formulate a reasonable scheduling scheme to arrange and allocate production resources, thereby obtaining the optimal scheduling result. The Cuckoo Search Algorithm (CS), a revolutionary meta-heuristic, is based on the cuckoo's breeding behavior and combines Lévy flight and random walk strategies to more efficiently attain the search goal. CS algorithm has been extensively employed in a variety of intricate combinatorial optimization issues, with its few parameters, precise resolution, random search path optimization, robust search aptitude, and uncomplicated implementation leading to satisfactory outcomes. After in-depth research, we found that the cuckoo search algorithm excels in dealing with flexible workshop scheduling problems. We conduct a series of comparative experiments to further confirm the efficacy of this algorithm. The results show that the cuckoo algorithm performs well in global search and can be used to solve complex flexible workshop scheduling models.