存在柔性加工设备的二车间综合调度算法研究

发布时间：2018-04-05 23:10

本文选题：最早开始时间策略　切入点：缓冲工序提前迁移策略　出处：《哈尔滨理工大学》2017年硕士论文

【摘要】：传统的产品制造过程,将加工和装配作为两个独立的阶段,对问题的研究主要针对零部件的批量加工。随着社会多元化需求的增加,多品种小批量的订单逐渐增多,在这种多元化需求环境驱动下,需要一种新的生产调度模式,满足人们个性化定制型产品的需求。这样,综合调度应运而生,它将产品的加工过程和装配过程统一为加工过程,将复杂产品虚拟映射为树状加工树。由于同时考虑了工序间的顺序约束和装配约束,综合调度在缩短产品制造周期、提高生产系统效率方面,具有重要的研究意义和实际应用价值。经过多年的发展,综合调度问题的研究已由单车间生产环境发展到了分布式生产环境,而现阶段研究的焦点主要针对二车间综合调度问题,并且已经取得了不错的研究成果。但是,以往的二车间综合调度问题研究文献,只考虑了复杂产品在普通设备上的加工情况。而随着加工技术、自动化技术的发展,柔性制造系统和数控加工中心等带有一定柔性的生产系统在实际企业生产中扮演着越来越重要的角色,柔性作业车间调度问题更加符合实际生产问题。因此本文主要研究存在柔性加工设备的二车间综合调度问题。针对复杂产品在具有柔性加工设备的二车间进行综合调度问题,本文首先提出了基于最早开始时间的二车间柔性综合调度算法,提出最早开始时间策略、最快处理速度策略以及长路径策略,在每次迭代循环中,同时确定待调度工序,工序的加工车间、设备以及开工时间,实例验证表明,该算法能够较好的解决复杂产品在存在柔性加工设备的二车间进行综合调度问题。其次,针对贪心算法并不一定每次都产生较好解的问题,提出基于集束搜索的二车间柔性综合调度算法,算法采用集束搜索的框架,将上述策略作为局部选择策略,提出过滤规则,限制产生的孩子节点个数,提出全局评估策略,为每个父节点工序保留唯一的孩子节点,算法复杂度分析及实例验证表明,所提算法在增加了复杂度的前提下实现了调度结果的优化。最后,本文提出缓冲工序提前迁移的二车间柔性综合调度算法,采用父路径长优先策略、长用时策略以及可用设备少策略确定工序的调度顺序;提出叶节点工序选择策略、缓冲工序提前迁移策略以及普通工序处理策略确定工序的加工车间和加工设备;采用前沿贪心策略的思想,结合产品工艺约束、迁移时间约束以及机器占用约束确定工序的开工时间,复杂度分析及实例验证表明,该算法同样能够在较低的复杂度内实现产品在存在柔性加工设备的二车间的综合调度。
[Abstract]:In the traditional manufacturing process, machining and assembly are regarded as two independent stages.With the increase of social diversified demand, the orders of multiple varieties and small batches are increasing gradually. Driven by this diversified demand environment, a new production scheduling mode is needed to meet the needs of personalized customized products.In this way, integrated scheduling emerges as the times require. It unifies the machining process and assembly process of the product into the machining process, and maps the complex product virtual to the tree-like machining tree.Because the sequential constraints and assembly constraints among the processes are considered at the same time, the comprehensive scheduling has important research significance and practical application value in shortening the production cycle and improving the efficiency of production system.After years of development, the research of integrated scheduling problem has been developed from a single workshop production environment to a distributed production environment. At this stage, the focus of the research is mainly on the two-shop integrated scheduling problem, and good research results have been achieved.However, in the previous literature, only the complex products are processed on the common equipment.With the development of machining technology and automation technology, flexible manufacturing system and NC machining center are playing more and more important role in actual enterprise production.Flexible job shop scheduling problem is more in line with the actual production problem.Therefore, this paper mainly studies the two-shop integrated scheduling problem with flexible processing equipment.Aiming at the problem of integrated scheduling of complex products in the second job shop with flexible processing equipment, this paper first proposes a flexible integrated scheduling algorithm based on the earliest start time, and puts forward the earliest start time strategy.The fastest processing speed strategy and long path strategy, in each iteration cycle, at the same time to determine the scheduling process, the process workshop, equipment and start up time, examples show that,The algorithm can solve the complex product scheduling problem in the second workshop with flexible processing equipment.Secondly, aiming at the problem that greedy algorithm does not always produce a better solution, a two-shop flexible integrated scheduling algorithm based on cluster search is proposed. The algorithm adopts the framework of cluster search and takes the above strategy as the local selection strategy.A filtering rule is proposed to limit the number of child nodes generated, and a global evaluation strategy is proposed to preserve a unique child node for each parent node process.The proposed algorithm achieves the optimization of scheduling results on the premise of increasing complexity.Finally, this paper proposes a flexible and integrated scheduling algorithm for the second workshop, which uses the long path priority strategy, long time strategy and less available equipment strategy to determine the scheduling order of the process, and proposes the selection strategy of the leaf node process.The buffer process migration strategy and the common process processing strategy are used to determine the process workshop and processing equipment, and the idea of frontier greedy strategy is adopted, and the product process constraints are combined.Migration time constraint and machine occupation constraint are used to determine the start time of the process. The complexity analysis and the example verification show that the algorithm can also achieve the integrated scheduling of the product in the second workshop with flexible machining equipment in the lower complexity.
【学位授予单位】：哈尔滨理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP301.6;TB497

【参考文献】