基于动态调整叶节点工序的综合调度算法  

An integrated scheduling algorithm based on dynamically adjusting leaf node processes

作　　者：刘显超 赵男 杨茁 苏艳会 周伟[1] LIU Xianchao;ZHAO Nan;YANG Zhuo;SU Yanhui;ZHOU Wei(College of Computer Science,Jilin Normal University,Siping Jilin 136000,China;Siping No.25 Middle School,Siping Jilin 136000,China;Affiliated School,Jilin Normal University,Siping Jilin 136000,China;Changchun No.16 Middle School,Changchun 130000,China)

机构地区：[1]吉林师范大学计算机学院,吉林四平136000 [2]四平市第二十五中学,吉林四平136000 [3]吉林师范大学附属学校,吉林四平136000 [4]长春市第十六中学,长春130000

出　　处：《智能计算机与应用》2022年第12期208-213,共6页Intelligent Computer and Applications

基　　金：教育部科技司赛尔网络下一代互联网技术创新项目(NGII20180408);吉林省社科项目(2020C048);吉林师范大学校级项目“三基一新”型计算机专业人才培养模式研究与实践。

摘　　要：针对目前综合调度算法中因忽略叶节点工序的调度优势而导致设备利用率较低、工序间衔接度较弱的问题,提出了基于动态调整叶节点工序的综合调度算法。算法将复杂产品工艺树中的叶节点工序作为影响综合调度整体优化的关键因素,通过循环更新和调度叶节点工序达到优化复杂产品综合调度时间成本的目的。In the existing integrated scheduling algorithms, the convergence degree between processes is weakened and the utilization rate of equipments is reduced due to the neglect of the scheduling advantages of leaf node processes. To solve this problem, an integrated scheduling algorithm based on dynamically adjusting leaf node processes is proposed. The algorithm takes the leaf node processes in the process tree of complex products as an important factor of integrated scheduling and reduces the time cost of integrated scheduling through cyclic updating and scheduling leaf node processes.

关 键 词：综合调度 叶节点工序 动态调整 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]