中国机械工程2024，Vol.35Issue(8)：1462-1471,1508,11.DOI:10.3969/j.issn.1004-132X.2024.08.014
改进Jaya算法求解混合流水车间调度问题
Improved Jaya Algorithm for Solving HFSPs
摘要
Abstract
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.关键词
混合流水车间调度/路径重连/禁忌搜索/完工时间Key words
hybrid flow-shop scheduling problem(HFSP)/path relink/Tabu search/makespan分类
机械制造引用本文复制引用
周豪,张超勇,刘辉,罗敏..改进Jaya算法求解混合流水车间调度问题[J].中国机械工程,2024,35(8):1462-1471,1508,11.基金项目
国家重点研发计划(2022YFE0114200) （2022YFE0114200）
