关键设备工序紧凑的动态调度算法  

A Dynamic Scheduling Algorithm Based on Key Equipment's Compact Procedures

作　　者：谢志强[1] 郑翘[2] 刘胜辉[1] 

机构地区：[1]哈尔滨理工大学计算机与控制学院,黑龙江哈尔滨150080 [2]哈尔滨职业技术学院,黑龙江哈尔滨150000

出　　处：《哈尔滨理工大学学报》2003年第2期50-53,共4页Journal of Harbin University of Science and Technology

基　　金：国家自然科学基金资助(69984002);黑龙江省优秀回国人员基金(F9918);哈尔滨市留学回国人员基金(9883218004)

摘　　要：针对求动态Job-Shop调度最优解这一复杂问题,提出了通过对不同时刻开始加工产品加工树的分解方法,将产品加工工序分为存在具有惟一紧前、紧后相关工序和独立工序,在对这两类工序分批、综合研究时,应用拟关键路径法(ACPM)和最佳适应调度方法(BFSM)调度,并考虑了关键设备的工序紧凑性.通过分析与实例验证,所提出的调度方法对解决动态的Job-Shop调度问题不仅算法简练,而且效果较好.As to a complicated problem of request dynamic Job -Shop scheduling optimum result, the working procedures of products could be divided into the attached one which has the only precursor and subsequence and unattached one by analyzing products, which processed start on different time, procession tree. When ACPM (allied critical path method) and BFSM (best fit scheduling method) are applied to these two procedures and considering the procedures are grouped, the compact of the procedures should be taken into account. The scheduling algorithm presented in this paper is concise and satisfying for settling dynamic Job -Shop scheduling by being tested with practical examples.

关 键 词：动态调度算法 动态Job-Shop调度 最优解 拟关键路径法 最佳适应调度法 产品加工 加工工序 

分 类 号：TH16[机械工程—机械制造及自动化]