华中科技大学学报（自然科学版）2025，Vol.53Issue(12)：28-33,41,7.DOI:10.13245/j.hust.251204
改进的HIG算法优化分布式流水车间组调度问题
Improved HIG for distributed flow shop group scheduling problems
摘要
Abstract
According to the existing historical information based iterated greedy algorithm(HIG),an improved HIG was proposed to optimize the total flow time objective for distributed flow shop group scheduling problems.There were two main improvements in the improved HIG:a neighborhood search operator for multiple consecutive jobs based on the dominance criterion was proposed,which deterministically improved the quality of candidate solutions with low computational complexity;the dual solution information of the set covering model in the HIG was used to heuristically guide the search process of candidate solutions.Finally,the results of the fusion experiment confirmed the effectiveness of the two improvement mechanisms.Meanwhile the experimental results of 270 cases were compared with those of existing representative algorithms.The proposed algorithm refreshed the optimal solution of the compared algorithms in at least 60%of the cases.关键词
分布式流水车间/组调度问题/总流经时间/支配准则/邻域搜索/对偶信息/迭代贪心Key words
distributed flow shop/group scheduling problem/total flow time/dominance criterion/neighborhood search/dual information/iterated greedy分类
信息技术与安全科学引用本文复制引用
HE Xuan,PAN Quanke..改进的HIG算法优化分布式流水车间组调度问题[J].华中科技大学学报（自然科学版）,2025,53(12):28-33,41,7.基金项目
国家自然科学基金资助项目(62273221) （62273221）
上海市"科技创新行动计划"优秀学术/技术带头人项目(21XD1401000). （21XD1401000）
