HFSP was an NP-hard problem widely presented in process manufacturing systems.For HFSP aimed at minimizing makespan,an improved Jaya algorithm was proposed by combining the advantages of Jaya algorithm and Tabu search.During the iterative update phase of the algorithm,a path reconnection-based method was proposed for the discrete update of the algorithm according to the designed coding,which ensured the diversity of the population and enhanced the global search ca-pability.To improve local search capability,a Tabu search algorithm integrating two types of neigh-borhood structures was proposed to further enhance the quality of solutions,and the neighborhood structures were adjusted adaptively according to the characteristics of the problem.The proposed algo-rithm was used to solve three types of HFSP benchmark sets.New optimal solutions are found in large-scale classic benchmark sets,which are superior to other algorithms in the current literatures in terms of solution quality,verifying the effectiveness and superiority of the proposed algorithm.
国家科技期刊平台
NSTL
万方数据
