This paper presents the development of a hybrid discrete artificial bee colony (HDABC) algorithm for solving flow shop scheduling problem with sequence dependent setup time. The objective is to find a schedule which minimizes the make span. In the HDABC, each solution to the problem is called a food source and represented by a discrete job permutation. The algorithm has two phases namely, employed bee phase and onlooker bee phase. Iterated greedy algorithms comprised of local search procedures

more »

... ased on insertion and swap neighborhood structures are used in both employed bee phase and onlooker bee phase of the algorithm. One of the seed sequence used in the algorithm is developed using well-known NEHRB heuristic and all other solutions are randomly generated. HDABC algorithm is tested on benchmark problems, and finally it is compared with an existing algorithm to evaluate the performance. Index Terms: flow shop scheduling, sequence dependent, artificial bee colony, tournament selection, local search.