Hybrid Constrained Flow Shop Scheduling Based on Improved Artificial Bee Colony Algorithm
LIU Xingda
LYU Yuke
ZHOU Yanping
Abstract：In this paper,an improved artificial bee colony algorithm is proposed for hybrid constrained flow shop(HCFSP)scheduling problem.Based on the fusion of tabu search algorithm,this algorithm uses NEH heuristic algorithm to generate high-quality initial solution.Because NEH does not necessarily give the shortest or optimal sequence,but it can ensure local opti-mality to a certain extent,and because of its excellent solution speed,it can be used as the initial solution set of other algorithms,that is,it can be used to generate the initial honey source space.The tabu search algorithm is integrated in the detection bee stage.By maintaining the tabu table and prohibiting local search,the problem of falling into the local optimal solution is effectively avoid-ed and the population diversity is increased.After integrating the advantages of the two algorithms,this paper verifies the improved artificial bee colony algorithm through four scale examples,and proves that the improved artificial bee colony algorithm has good convergence and robustness,In terms of convergence speed and accuracy,it has been greatly improved compared with the previous one.
Keywords：hybrid constrained flow shop schedulingartificial bee colony algorithmNEH initializationtabu search algo-rithm
Publication Date：2025-12-20
Online Publishing Date：2026-03-09(First online date of this platform, not the publication date of the document)
Pages：6( 3429-3434 )