Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion (Q2263748)

Summary: In this paper, a modified artificial bee colony algorithm is proposed to solve the permutation flow shop scheduling problem with makespan criterion. Originally developed for numerical optimisation, local search techniques are integrated into the algorithm to solve flow shop problems. \textit{J. Carlier} [RAIRO, Rech. Opér. 12, 333--350 (1978; Zbl 0401.90052)] and \textit{C. R. Reeves} [Comput. Oper. Res. 22, No. 1, 5--13 (1995; Zbl 0815.90097); J. Oper. Res. Soc. 44, No. 4, 375--382 (1993; Zbl 0775.90238)] test problems from the literature are used to compare the performance of the algorithm against the best known solutions, NEH and with different meta-heuristic techniques. It is seen that for all the Carlier's instances, proposed algorithm is able to find the best solutions, whereas for the Reeves's cases best solutions of 13 problems from a total of 21 are found. Also, a new best solution is found for the Rec23 instance. Finally, statistical analyses are done to evaluate the proposed algorithm's performance.