关键词: 工件约束, 蚁群优化算法, 优先分配启发算法, 模具制造, 动态调度

Abstract: A scheduling system was established to solve the dynamic scheduling problem in mold manufacturing. The system combined the Ant Colony Optimization (ACO) algorithm and the dispatching priority heuristic algorithm to solve the scheduling problems existing in mold parts with work piece restrictions. Firstly, ACO was used to determine the machines needed in each working procedure,then priority heuristic algorithm was used to set the sequence of the parts to be machined in the same machine. A dynamic scheduling algorithm based on moving window and consideration of local and global update was put forward for real-time mold scheduling. Local update strategy was adopted for those turbulences, which happened in high frequency but with little influence on the scheduling; otherwise, global update strategy was adopted. The scheduling efficiency was improved as well as the near-optimum solution was guaranteed.

Key words: work piece restriction, ant colony optimization algorithm, dispatching priority heuristic algorithm, mold manufacturing, dynamic scheduling