电机产品加工的动态调度算法  

Dynamic Scheduling Algorithm for Electric Machines Producing

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

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

出　　处：《计算机集成制造系统-CIMS》2003年第6期444-448,共5页

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

摘　　要：考虑多个具有不同开始时间的电机产品加工动态调度问题,将产品加工树的工序,分为具有唯一紧前或紧后工序的相关工序和独立工序两类,提出相关工序调度的拟关键路径法和独立工序调度的最佳适应调度法。结合拟关键路径法和最佳适应调度法,提出考虑关键设备的工序紧凑的多产品动态调度算法。实例数据表明,动态调度算法在总加工时间方面比一般启发式算法更短,适合于有不同开始时间的多产品动态调度环境。The dynamic scheduling problem of processing electric machines with different start time is discussed. Operations of a processing tree are classified into dependent operations with either a predecessor or a successor and independent operations. The pseud critical path method (PCPM) is presented for the dependent operations and the best fit scheduling method (BFSM) is presented for the independent operations. Operations on critical machines are tightened to minimize idles. Combining PCPM and BFSM, a dynamic scheduling algorithm (DSA) is introduced for multiple products. At last the instance shows that the make span of DSA is shorter than that of a general heuristic algorithm.

关 键 词：动态调度算法 拟关键路径法 最佳适应调度法 关键设备 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]