求解IPPS顺序柔性调度问题的模型与集成型调度算法研究  

Research on model and integrated scheduling algorithm for IPPS problem with sequencing flexibility

作　　者：黄学文 孙榕 李冠雄 Huang Xuewen;Sun Rong;Li Guanxiong(Faculty of Management ＆ Economics,Dalian University of Technology,Dalian Liaoning 116024,China)

机构地区：[1]大连理工大学管理与经济学部,辽宁大连116024

出　　处：《计算机应用研究》2018年第12期3710-3715,共6页Application Research of Computers

基　　金：国家科技支撑计划资助项目(2015BAF09B01)

摘　　要：针对工艺规划与调度集成(integrated process planning and scheduling,IPPS)问题中的顺序柔性调度问题,提出了基于简单顺序关系的顺序柔性描述模型及调度模型,并改进遗传算法设计了集成型的顺序柔性调度算法。染色体编码同时采用简单顺序关系编码和基于工序的编码,并为两种编码分别设计了多种交叉和变异操作。为避免遗传算子产生违背工序顺序优先关系的不可行解,提出了顺序约束修正策略;针对遗传算法易过早收敛的缺陷,设计了自适应调节变量以强化种群多样性,并引入变邻域搜索算法改变解的搜索邻域,进一步搜索最优调度方案。三种不同规模的实验仿真验证了问题描述模型及调度算法的有效性。To solve the integrated process and planning scheduling（ IPPS） problem with sequencing flexibility,the paper proposed a representing model and a mathematical scheduling model for sequencing flexibility based on the simple order relationship. Moreover,on the basis of improved genetic algorithm（ GA）,it presented an integrated scheduling algorithm for sequencing flexibility. The coding of a chromosome was a combination of simple order relationship code and operation-based code. It specified a variety of operators of crossover and mutation to these two codes. A sequencing constraint modification strategy could avoid generating any infeasible solution which violated precedence relationships of operations. To solve premature convergence of genetic algorithm,it introduced an adaptive variable to enhance the diversity of population. The variable neighborhood search（ VNS） algorithm also contributed to explore an optimal solution while changing the searching neighborhood.Three experiments of different scales show the effectiveness of the representing model and the developed algorithm.

关 键 词：IPPS问题 顺序柔性集成调度 描述与调度模型 改进遗传算法 

分 类 号：TH165[机械工程—机械制造及自动化]