控制理论与应用2024，Vol.41Issue(6)：1147-1155,9.DOI:10.7641/CTA.2023.20900
求解能耗成本平衡的分布式阻塞流水线调度群体迭代贪婪算法
An iterated greedy algorithm based on population evolution for distributed blocking flowshop scheduling with balanced energy costs criterion
摘要
Abstract
Based on the classical distributed flowshop scheduling problem,this paper constructs the mixed linear in-teger programming mode(MILP)of distributed blocking flowshop scheduling problem with sequence-dependent setup time(DBFSP_SDST),and the optimization objective is to balance the energy consumption cost of each factory.To tack-le this problem,an iterated greedy algorithm based on the population evolution(PEIG)is proposed.In PEIG,firstly,a problem-specific heuristic is well designed based on the blocking constraint and multiple factories model.Secondly,for the advantages and disadvantages of the traditional IG algorithm,the local search strategies based on the population operation,the multiple neighborhood search structures,and the cross-factory destruction-reconstruction strategy are proposed to fur-ther balance the global exploration and exploitation abilities of the proposed algorithm.The 270 test instances numerical simulations and statistical comparison with four representative algorithms show that the proposed algorithm has superior performance and can provide a better scheduling scheme for medium and large-scale DBFSP_SDST than the compared algorithms.关键词
分布式/阻塞流水调度/能耗成本/群体局部搜索策略/迭代贪婪算法Key words
distributed/blocking flowshop scheduling/energy consumption cost/local search strategy based on popu-lation/iterated greedy algorithm引用本文复制引用
韩雪,王玉亭,韩玉艳,李俊青..求解能耗成本平衡的分布式阻塞流水线调度群体迭代贪婪算法[J].控制理论与应用,2024,41(6):1147-1155,9.基金项目
国家自然科学基金项目(61803192,62173216,62173356),聊城大学光岳青年学者创新团队项目(LCUGYTD2022-03)资助.Supported by the National Natural Science Foundation of China(61803192,62173216,62173356)and the Liaocheng University Guangyue Youth Scholar Innovation Team(LCUGYTD2022-03). （61803192,62173216,62173356）
