加工时间模糊车间多目标调度与奖惩灰靶决策  

Workshop multi-object scheduling under fuzzy processing time and rewards-punishments grey target decision

作　　者：韩文颖 赵明君[2] 春兰 巴特尔 HAN Wenying;ZHAO Mingjun;CHUN Lan;BA Teer(Department of Engineering Training and Teaching,Inner Mongolia University of Technology,Hohhot 010051,CHN;Sub-Branch of Ultra-high Voltage Substation,State Grid Shanxi Electric Power Company,Taiyuan 030000,CHN)

机构地区：[1]内蒙古工业大学工程训练教学部,内蒙古呼和浩特010051 [2]山西省电力公司超高压变电分公司,山西太原030000

出　　处：《制造技术与机床》2024年第1期108-114,共7页Manufacturing Technology & Machine Tool

基　　金：内蒙古工业大学科学研究项目(X201720);内蒙古自治区自然科学基金资助项目(2018LH05031);2023内蒙古自治区直属高校基本科研业务费项目(JY20230041)。

摘　　要：为了实现加工时间模糊条件下柔性车间多目标优化调度,提出了基于邻域动态选择NSGA-II算法的优化方法和基于奖惩灰靶理论的决策方法。针对加工时间模糊条件下的车间调度问题,采用模糊集理论建立了多目标优化调度模型。在调度优化方面,对NSGA-II算法选择策略进行改进,构造了邻域动态选择NSGA-II的车间调度多目标优化方法。在决策方面,在灰靶决策理论中引入了奖惩算子,该方法可以决策出信息熵意义下的最优结果。经生产案例验证,与标准NSGA-II算法、混沌映射NSGA-II算法、双层遗传算法等相比,邻域动态选择NSGA-II算法的Pareto解集处于支配地位,表明该方法优化能力最强;经加权灰靶理论决策的最优调度方案满足时间约束和逻辑约束,是一种可行调度方案。实验结果表明,优化和决策方法是可行的,且具有一定优越性。To achieve multi-objective optimization scheduling of flexible workshops under fuzzy processing time conditions,an optimization method based on neighborhood dynamic selection NSGA-II algorithm and a decision method based on weighted grey target theory were proposed.A multi-objective optimization scheduling model was established using fuzzy set theory for the workshop scheduling problem under fuzzy processing time conditions.In terms of scheduling optimization,the NSGA-II algorithm selection strategy was improved,and a multi-objective optimization method for workshop scheduling using neighborhood dynamic selection NSGA-II was constructed.In terms of decision-making,the reward and punishment operator was introduced into the grey target decision-making theory,and this method could determine the optimal result in the sense of information entropy.Through production case verification,compared with the standard NSGA-II algorithm,chaotic mapping NSGA-II algorithm,and double-layer genetic algorithm,the Pareto solution set of the neighborhood dynamic selection NSGA-II algorithm is in a dominant position,indicating that the optimization ability of this method is the strongest.The optimal scheduling scheme determined by the weighted grey target theory satisfies both time and logical constraints,which means it is a feasible scheduling scheme.The experimental results indicate that the optimization and decision-making methods proposed in this paper are feasible and they also have certain advantages.

关 键 词：模糊加工时间 柔性车间调度 NSGA-Ⅱ算法 奖惩灰靶决策 多目标优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TH165[自动化与计算机技术—控制科学与工程]