基于启发式倒排算法的配合加工调度问题研究

Job shop scheduling problem of matching machining based on backward heuristic scheduling algorithm

实际生产中的配合加工调度问题是生产调度理论研究的一个难点,它既要考虑常规调度标准约束,还要考虑工件与工件之间的配合工序约束。以最短加工时间为目标函数,建立配合加工调度模型,并采用启发式倒排算法对其进行求解。该算法能有效保证工件交货期,最后以一个实例验证算法的有效性。

Job shop scheduling problem of matching machining is a difficulty in the field of scheduling theory research.It not only considers general constraint but also mathcing operation constraint of related jobs.A mathematical model of the problem whose objective is to minimize the overall completion time is established.The backward heuristic scheduling algorithm is adopted to solve the model.It assures the delivery time.An example is illustrated to verify the effectiveness of algorithm.