缩短空闲时间的动态装配调度优化控制  

Optimization controlling algorithm of shortening idle time for the dynamic assembly scheduling

作　　者：谢志强[1] 郝淑珍[1] 丛? 谭光宇[2] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080 [2]哈尔滨理工大学机械动力工程学院,黑龙江哈尔滨150080

出　　处：《电机与控制学报》2008年第1期69-73,共5页Electric Machines and Control

基　　金：国家自然科学基金(50575062);黑龙江省自然科学基金(F200608);黑龙江省教育厅重大科技项目(10511z0008);哈尔滨市科技攻关项目(2005AAlCG061-11);黑龙江省教育厅海外学人重点科研资助项目(1152hq08)

摘　　要：针对动态装配调度只考虑独立工序按大小排序插入空闲时间段中存在较大空闲时间段被较小独立工序占用浪费空闲时间的问题,提出了缩短其空闲时间的方法。通过对不同时刻开始装配产品的装配工艺图进行分析,将动态装配问题中的产品装配工序虚拟分为具有惟一紧前、紧后的相关工序和独立工序,并对关键设备上的独立工序和空闲时间段分别按大小排序,通过二者的比较结果,采取将独立工序插入到相应的空闲时间段中的装配方法,达到减少设备总空闲时间,并使总装配时间不超过或尽量少超过由关键路径工序确定的装配时间。实例验证表明,该方法不仅复杂度较底而且可缩短动态装配总时间。Aiming at wasting idle time problem for the less independent operations being inserted in the biggish idle time in dynamic assembly scheduling that only considering the independent operations being sorted in descending, an optimization controlling algorithm of shortening idle time is presented for independent operations. This algorithm divided the operations into the independent operations and the dependent operations that have the only immediate predecessor and immediate successor by analyzing assembly operations chart with different starting assembly time. The independent operations and idle time on the Critical machine were sorted in descending respectively, and the independent operations were inserted in the corresponding idle time by comparing the assembly time of independent operation and idle time, in order to reduce the total idle time of the machines and make the total assembly time be less or a little more than the total assembly time of the operations on the critical path. The experiment shows that the algorithm proposed has lower complexity and can shorten the total assembly time.

关 键 词：空闲时间 独立工序 关键路径 动态装配调度 优化控制 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]