A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

To minimize the makespan in permutation flowshop scheduling problems, a hybrid discrete artificial bee colony (HDABC) algorithm is presented. In the HDABC, each solution to the problem is called a food source and represented by a discrete job permutation. First, the initial population with certain quality and diversity is generated from Greedy Randomized Adaptive Search Procedure (GRASP) based on Nawaz–Enscore–Ham (NEH) heuristics. Second, the discrete operators and algorithm, such as insert, swap, path relinking and GRASP are applied to generate new solution for the employed bees, onlookers and scouts. Moreover, local search is applied to the best one. The presented algorithm is tested on scheduling problem benchmarks. Experimental results show its efficiency.

Graphical abstractFigure optionsDownload full-size imageDownload as PowerPoint slideHighlights► We presented a new artificial bee colony algorithm for flowshop scheduling problems. ► Each solution to the problem is represented by a discrete job permutation. ► The discrete operators and algorithm are applied to generate new solution. ► Local search is applied to the best one to improve quality.