Bees algorithm a novel method for solving flexible job shop scheduling

Abstract

This is a research paper on the use of the Bees Algorithm (BA) to solve the flexible job shop scheduling problem (FJSP), with the purpose of calculating the maximum completion time (makespan). Using search functions such as global search and local search, we can find results based on the Bees Algorithm. To conduct this search, the algorithm requires generating initial solutions using the random rule of the dispatching rule. Bees Algorithm will perform a more thorough search for another result based on the initial results using operators such as neighborhood swap and single-point insertion. Furthermore, the global search of the Bees Algorithm is created with the feature of generating random solutions to increase the probability of finding solutions, and this global search will run in parallel with the local search. Finally, the computed outputs of the Bees Algorithm will be compared to other algorithms to see how effective the algorithm is at solving the flexible job shop problem using public benchmark data.