Solution of distributed permutated flow shop scheduling problems and artificial bee colony algorithm

In this study, distributed permutation flow shop scheduling problems with minimum function completion time are discussed. The difference between this problem and the classical flow shop scheduling problem is that the works are distributed to more than one factory. In order to solve the problem, artificial bee colony algorithm based on the nutrient search behavior of bees in nature was used. The NEH intuition was used to generate the initial solutions of the algorithm. In the phases of the algorithm, the method of displacement for neighboring solutions (employed, onlooker and scout bee phases) was used. In this method, different jobs were obtained by changing the positions of two randomly selected jobs. The success of the algorithm on the problem has been demonstrated in the literature by using well-known Taillard's small and large sized test problems. The algorithm was compared with 14 intuitive and presented best results. Keywords: Distributed Permutation Flow Shop Scheduling Problem, Artificial Bee Colony Algorithm