基于ACPM和BFSM的动态Job-Shop调度算法  

Dynamic Job-Shop Scheduling Algorithm Based on ACPM and BFSM

作　　者：谢志强[1] 刘胜辉[1] 乔佩利[1] 

机构地区：[1]哈尔滨理工大学计算机与控制学院,哈尔滨150080

出　　处：《计算机研究与发展》2003年第7期977-983,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金 ( 699840 0 2 ) ;黑龙江省科学技术计划基金 (L99 14 ) ;哈尔滨市留学回国人员基金 ( 9883 2 180 0 4)

摘　　要：通过对不同时刻开始加工的产品加工树的分解 ,可将产品加工工序分为具有惟一紧前、紧后的相关工序和独立工序 在对这两类工序研究分批综合应用拟关键路径法 (ACPM )和最佳适应调度方法 (BFSM)调度时 ,考虑了关键设备的工序紧凑性 通过分析与实例验证 ,所提出的调度方法对解决动态的JobBy analyzing the products processing trees which start processing on different time, the working procedures of products could be divided into the attached one, which has the only precursor and subsequence, and the unattached one When ACPM (allied critical path method) and BFSM (best fit scheduling method) are applied to these two procedures and the procedures are grouped, the compactness of the procedures should be taken into account The result of test with practical examples shows that scheduling algorithm presented in this paper is concise and satisfying for settling dynamic Job Shop scheduling

关 键 词：动态Job—Shop调度 拟关键路径法 最佳适应调度法 紧凑 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]