Answers are grounded in this paper and cite their sources.
This approach demonstrates enhanced scheduling efficiency for AGVs and machines, indicating robust performance in job shops.
Abstract For the joint scheduling problem of AGVs and machines in job shops, traditional scheduling methods are often constrained and difficult to adapt to complex production environments and demand changes. For this reason, this paper proposes a PPO algorithm based on two-dimensional action space to solve the joint scheduling problem of AGVs and machines in the job shop. First, the computation of the loss function is modified for the characteristics of the two-dimensional action space to ensure a stable learning performance of the policy gradient. Then, the PPO-Clip version of the objective function is used for policy updating. The experimental results of randomized arithmetic cases show that the PPO algorithm based on two-dimensional action space has better training effect and convergence performance on the joint scheduling problem of AGVs and machines in the job shop. Compared with traditional methods, the algorithm has a large improvement in the optimal solution for most instances. In scalability tests in large-scale scenarios, the 2D-PPO-based algorithm exhibits high solution efficiency and robustness, especially in maintaining consistency with the solution quality of the optimal scheduling rule.
No takes yet. Share an insight, caveat, or question.
Sun et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: