针对自动化仓库中直线型轨道RGV调度问题，以任务完成最多为目标，结合分治算法，提出基于CNC动态优先级的调度算法。该算法综合了就近原则、最短等待时间原则、最短上料时间原则，就RGV的路径选择与故障情况的解决办法给出了比较好的答案。并利用Matlab验证在实例情形下计算8小时内所能加工的最大物料数和最大工作效率，在实例中，通过与自适应遗传算法对比可验证本算法具有良好的有效性。
The core of intelligent RGV dynamic scheduling strategy is to maximize the system efficiency, and priority determination of CNC machining is a powerful guarantee for maximizing efficiency. Based on the dynamic scheduling priority algorithm, this paper sets the priority selection criteria for the workbench by integrating the nearby principle, the shortest waiting time principle and the shortest feeding time principle. And taking the shortest task completion time as the goal, the paper gives a good answer to the path selection and the arrangement of the occurrence of fault in dynamic scheduling. Finally, Matlab is used to verify the maximum number of materials and the maximum working efficiency that can be processed within 8 hours under different cases of instance data. After verification, this strategy has good effectiveness.
Gao, L., Zhang, G.H., Zhang, L.P., et al. (2011) An efficient Memetic Algorithm for Solving the Job Shop Scheduling Problem. Computers & Industrial Engineering, 60, 699-705. https://doi.org/10.1016/j.cie.2011.01.003
[4]
Xia, W. and Wu, Z. (2005) An Effective Hybrid Optimization Approach for Mul-ti-Objective Flexible Job-Shop Scheduling Problems. Computers & Industrial Engineering, 48, 409-425. https://doi.org/10.1016/j.cie.2005.01.018
[5]
Wu, L.H., Mok, P.Y. and Zhang, J. (2010) An Adaptive Multi-Parameter Based Dispatching Strategy for Single-Loop Interbay Material Handling Systems. Computers in Industry, 62, 175-186.
https://doi.org/10.1016/j.compind.2010.10.010
