基于择时的二车间综合调度算法

发布时间：2018-06-01 06:48

本文选题：工序序列 + 择时策略　；参考：《计算机集成制造系统》2017年09期

【摘要】：针对现有二车间综合调度算法在处理具有相同设备资源的二车间综合调度问题时,注重工艺树的横向并行处理,忽略纵向串行工序之间的紧密度,将二车间均衡处理或减少工序迁移次数一并做为调度目标导致不必要时间开销的问题,提出了基于择时的二车间综合调度算法。同时,提出了工序序列排序策略,将加工工艺树划分为若干工序序列,并根据其路径长度确定调度次序;提出了二车间择时调度策略,为工序寻找加工开始时间和加工车间,生成使当前部分产品加工总用时最小的工序调度方案。若该方案不唯一,则选择在二车间中该工序加工结束时间最早的工序调度方案。所提算法既保证了并行工序的并行处理,又有效地提高了串行工序的紧密度,避免了无效工序迁移带来的时间开销。通过实例说明了所提算法的有效性。
[Abstract]:In view of the existing two-shop integrated scheduling algorithm, when dealing with the two-shop integrated scheduling problem with the same equipment resources, it pays attention to the horizontal parallel processing of the process tree and neglects the tightness between the longitudinal serial processes. This paper presents a scheduling algorithm based on timing, which takes the equalization of two job shop or reducing the number of process migration as the scheduling target, which results in unnecessary time cost. At the same time, the scheduling strategy of process sequence is put forward, the process tree is divided into a number of process sequences, and the scheduling order is determined according to its path length. To generate a process scheduling scheme that minimizes the total processing time of the current part of the product. If the scheme is not unique, the scheduling scheme with the earliest processing end time is selected in the second workshop. The proposed algorithm not only guarantees the parallel processing of parallel processes, but also effectively improves the tightness of serial processes, and avoids the time cost caused by invalid process migration. An example is given to illustrate the effectiveness of the proposed algorithm.
【作者单位】：哈尔滨理工大学计算机科学与技术学院;哈尔滨工程大学计算机科学与技术学院;
【基金】：国家自然科学基金资助项目(61370086,61370083,61772160) 黑龙江省教育厅科技计划资助项目(12531105) 黑龙江省博士后基金资助项目(LBH-Q13092,LBH-Z15096) 中国博士后资助项目(2016M591541) 高等学校博士学科点专项科研基金资助项目(20122304110012)~~
【分类号】：TB497

【相似文献】