African Buffalo Optimization for Solving Flow Shop Scheduling Problem to Minimize Makespan

Abstract

In this paper, African Buffalo Optimization is proposed to solve the flow-shop Scheduling Problem (FSP). The FSP involves n-job that was processed in m-machine. The aim is to reduce the makespan of the whole process. In this study, we also compare the African Buffalo Optimization with an exact solution and other meta-heuristic methods, such as Particle Swarm Optimization (PSO), Hybrid Genetics Algorithm, and also Crow-search Algorithm (CSA) to know the performance of the methods in solution quality and computational time. Friedman test showing African Buffalo Optimization gives an optimal solution in solution quality, the same result with the exact solution, PSO, and hybrid GA.