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

A Scheduling Algorithm Based on Key Equipment Compact Procedures

作　　者：谢志强[1] 刘胜辉[1] 李树生 

机构地区：[1]哈尔滨理工大学计算机与控制学院,黑龙江哈尔滨150080 [2]哈尔滨绝缘材料厂,黑龙江哈尔滨150040

出　　处：《哈尔滨理工大学学报》2003年第1期37-41,45,共6页Journal of Harbin University of Science and Technology

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

摘　　要：针对求Job-Shop调度最优解这一复杂问题,对产品加工树进行分解,将产品加工工序分为惟一紧前、紧后相关工序和独立工序,当这两类工序分批采用拟关键路径法(ACPM)和最佳适应调度法(BFSM)调度时,提出了关键设备工序紧凑性的新调度算法.通过分析与实例验证,所提出的新调度方法不仅简练而且获得了满意的结果.As to a complicated problem of request Job-Shop scheduling optimum result,a new scheduling algorithm is presented. 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 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 is concise and the result obtained is satisfying for settling complicated Job-Shop scheduling by being tested with practical examples.

关 键 词：调度算法 拟关键路径法 最佳适应调度法 关键设备 JOB-SHOP调度 产品加工树 最优解 工序紧凑性 

分 类 号：TH16[机械工程—机械制造及自动化] O224[理学—运筹学与控制论]