聊城大学学报（自然科学版）2025，Vol.38Issue(4)：475-484,10.DOI:10.19728/j.issn1672-6634.2024070003
一种有效的数学启发式算法优化分布式置换流水车间调度问题
An effective matheuristic algorithm for distributed permutation flowshop problem
摘要
Abstract
In recent years,the manufacturing model of enterprises has changed from traditional single-fac-tory centralized production to distributed collaborative production of multiple factories distributed in differ-ent geographical locations.Distributed permutation flowshop scheduling problem has emerged.Although a lot of research has been done on this problem in academia,studying its efficient solution method is still an open topic.This paper compares the advantages and disadvantages of two existing mixed integer pro-gramming models for the total flow time optimization objective,and obtains the optimal solution on a small-scale problem instance.For large-scale problem instances,this paper proposes an effective matheu-ristic algorithm.Based on the existing DLR-DNEH,the proposed matheuristic algorithm designs a set covering model to collect effective search patterns contained in insertion neighborhood structure.Finally,a large number of experimental results on the standard test set show the effectiveness of the proposed algo-rithm.关键词
分布式置换流水车间调度问题/总流经时间/数学启发式算法/集合覆盖模型Key words
distributed permutation flowshop scheduling problem/total flow time/matheuristic algo-rithm/set covering model分类
机械制造引用本文复制引用
何轩,狄士璐,刘欢,杜松霖,郭恒伟,邵仲世..一种有效的数学启发式算法优化分布式置换流水车间调度问题[J].聊城大学学报（自然科学版）,2025,38(4):475-484,10.基金项目
中国博士后科学基金项目(2023M732166) （2023M732166）
国家自然科学基金项目(62406196)资助 （62406196）
