基于工序集的多阶段混合流水车间调度问题研究  

Research on Multi-Stage Hybrid Flow Shop Scheduling Based on Process Set

作　　者：唐红涛[1,2] 杨志鹏 TANG Hongtao;YANG Zhipeng(School of Mechanical and Electrical Engineering,Wuhan University of Technology,Wuhan 430070,China;Hubei Key Laboratory of Digital Manufacturing,Wuhan 430070,China)

机构地区：[1]武汉理工大学机电工程学院,湖北武汉430070 [2]湖北省数字制造重点实验室,湖北武汉430070

出　　处：《工业工程与管理》2021年第4期60-68,共9页Industrial Engineering and Management

基　　金：国家自然科学基金项目(51705384);湖北省自然科学基金(2016CFB175)。

摘　　要：针对砂型铸造车间包含并行工序集与批处理集的多阶段调度问题,总结了该类问题的特点和难点,构建了以最小化最大完工时间为优化目标的多阶段混合流水车间调度模型,采用了一种改进人工蜂群算法求解该模型。在算法中提出了基于插入原理与前驱工序释放时间的分段解码方法来有效利用机器空闲时间段,并引入了动态触发邻域机制增强算法的局部搜索能力,最后通过仿真实验验证了本文算法,解决此类问题的可行性和有效性。In view of the multi-stage scheduling problem based on parallel process set and batch processset in sand casting workshop,the characteristics of this kind of problem were summarized,a multi-stage hybrid flow-shop scheduling model with the objective of minimizing the maximum makespan was constructed,and an improved artificial bee colony algorithm was used to solve this model.In the algorithm,a segment decoding method based on the insertion principle and the release time of the immediate predecessor was proposed,which could effectively optimize the idle time of the machine.The dynamic trigger neighborhood-search was introducedto enhance the local search ability of the algorithm. Finally,the feasibility and effectiveness of the algorithmwere verified by simulation experiments.

关 键 词：并行工序集 批处理集 分段解码 人工蜂群算法 动态触发邻域搜索 

分 类 号：TG28[金属学及工艺—铸造] TP18[自动化与计算机技术—控制理论与控制工程]