作　　者： ; ; ; ;

机构地区： 哈尔滨理工大学

出　　处： 《黑龙江大学自然科学学报》 2007年第3期291-294,300,共5页

摘　　要： 根据实际装配情况,通过对产品装配工艺图的分析,将一般装配问题中的产品装配工序虚拟分为具有惟一紧前、紧后的相关工序和独立工序,并针对独立工序的装配提出了一种新的装配方法,即缩短空闲时间法.这种方法的主要思想是把关键设备上的独立工序与空闲时间段分别按大小排序,针对二者的比较结果,采取不同的将独立工序插入到相应的空闲时间段中的装配方法,达到减少设备总空闲时间,并且使总装配时间不超过或尽量少超过由关键路径工序确定的装配时间的目的.实例验证该算法对装配问题是可行且有效的. According to actual assembly conditions, the operations are divided into the dependent operations that had the only immediate predecessor and immediate successor and the independent ones in common assembly problems by analyzing the assembly operation chart. And a new assembly algorithm, named shorten idle time algorithm, is presented for assembly the independent operations. This algorithm scheduled the independent operations and idle times which were on the critical machine by size respectively and according to the comparative result, the algorithm used different methods to insert the independent operation to the corresponding idle time. This algorithm could reduce the total idle time of the machines and let the total assembly time be less than the total assembly time of the operations on the critical path. This assembly algorithm was proved to be practical and effective by examples for the assembly problems.

关 键 词： 空闲时间 独立工序 关键路径 装配问题

领　　域： [自动化与计算机技术] [自动化与计算机技术]