An effective fruit fly optimization algorithm for the hybrid flowshop scheduling problem

Fruit Fly algorithm (FFO) is a recently reported metaheuristics originally designed for function optimization problems. This paper proposes an effective FFO to solve the hybrid flowshop scheduling (HFS) problem with the aim of makespan optimization (minimization). In presented FFO, we utilize the permutation-based representation and operators. The presented FFO can directly explore the discrete solution space of the HFS problem. Extensive comparisons are carried out with well-known meta-heuristics. The results show that the developed FFO is very effective for the considered HFS problem.