基于关键设备工序紧凑的工序分类、分批的Job-Shop调度算法  

CLASSIFIED AND GROUPED JOB-SHOP SCHEDULING ALGORITHM BASED ON KEY EQUIPMENTS' COMPACT PROCEDURES

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

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

出　　处：《机械工程学报》2004年第8期13-17,共5页Journal of Mechanical Engineering

基　　金：国家自然科学基金(69984002);黑龙江省自然科学基金(F0309)资助项目。

摘　　要：通过对产品加工树的分解,可将产品加工工序分为存在具有唯一紧前、紧后相关工序和独立工序,在对这两类工序研究分批综合应用拟关键路径法(ACPM)和最佳适应调度方法(BFSM)调度时,考虑关键设备的工序紧凑性。通过分析与实例验证,所提出的调度方法对解决复杂Job-Shop调度问题不仅算法简练而且效果较好。The working procedures of products can 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 is concise and satisfying for settling complicated Job-Shop scheduling by tested with practical examples.

关 键 词：JOB-SHOP调度 工序分类 拟关键路径法 最佳适应调度法 产品加工树 

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