基于生产状态图和A*算法的柔性制造系统调度方法OA

Aiming at the state space explosion problem in job shop scheduling of flexible manufacturing sys-tems,a scheduling method based on production status graphs and the A* algorithm is proposed.First,a mixed-integer programming model for the scheduling problem is established,and a production status graph model is constructed to formally describe the system production status,thereby transforming the scheduling problem into a graph search task.Then,two heuristic functions are designed by integrating two key factors:the remaining time on critical path and total minimum processing time of remaining operations,obtaining high-quality scheduling strategies by the A* algorithm.Experimental results show that the heuristic function based on remaining critical path time satisfies admissibility and achieves globally optimal scheduling performance in smal-l scale scheduling scenarios.Although the heuristic function based on the total minimum processing time of remaining operations does not satisfy admissibility,it exhibits outstanding solution efficiency and achieves near-optimal scheduling performance in large-scale and multi-batch scenarios with superior overall perform-ance.The solution efficiency of the A* algorithm under both heuristic functions significantly outperforms that of the Dijkstra algorithm.