可动态生成具有优先级工序集的动态Job-Shop调度算法(.docVIP

可动态生成具有优先级工序集的动态Job-Shop调度算法(哈尔滨理工大学哈尔滨 150080哈尔滨大学哈尔滨 1500哈尔滨理工大学 机械动力工程学院 哈尔滨 150080Dynamic Job-Shop Scheduling Algorithm with Dynamic Set of Operation Having Priority XIE Zhiqiang 1) YANG Jing2) YANG Guang1) TAN Guangyu3) 1) (School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080) 2) (School of Computer Science and Technology, Harbin Engineering University, Harbin 150001) 3) (School of Mechanical Power Engineering, Harbin University of Science and Technology, Harbin 150080) Abstract To make the total processing time of job added into job set at different time as short as possible, subject to the constraint, a new algorithm is proposed: a virtual manufacturing tree is constructed according to dynamic job set, where leaf nodes denote the operations to process firstly, root nodes denote the operations to process last and edges denote the partial relation, that is constraint between operations; the priority of operations is set according to level of operation in the virtual manufacturing tree and is regarded as a factor considered to schedule operations; a strategy of keeping machine busy is adopted to make machine try its best to process operations continually except that operations need be modified dynamically. Standby operation set is generated dynamically according to the virtual manufacturing tree, and operations in the standby operation set, subject to the priority, are scheduled with Short-time strategy, Long-path strategy and Dynamic-adjustment strategy until the set is empty, that is all operations unscheduled are finished. The example shows that the algorithm proposed can obtain favorable result for dynamic Job-Shop scheduling problem. Keywords job-shop; virtual manufacturing tree; priority; standby operation set; dynamic adjustment 1 引言 理论上已经证明了作业车间调度问题是NP-Hard问题本文所研究的问题是在满足三个约束条件的前提下使加工的作业所用的时间尽可能的少这三个约束条件是（1）对于每道工序来说必须等待其所有的前继工序加工完毕后才能加工此道工序（2）对于每台机器来说任意时刻只能加工一道工序且必须满足加工完一道工序后才能加工另一道工序[1]（3）不存在相同设备本文首