Abstract
In accordance with the actual production circumstances of enterprises, a scheduling problem model is designed for open-shop environments, considering AGV transport time. A Q-learning-based method is proposed for the resolution of such problems. Based on the characteristics of the problem, a hybrid encoding approach combining process encoding and AGV encoding is applied. Three pairs of actions are constituted to form the action space. Decay factors and a greedy strategy are utilized to perturb the decision-making of the intelligent agent, preventing it from falling into local optima while simultaneously facilitating extensive exploration of the solution space. Finally, the proposed method proved to be effective in solving the open-shop scheduling problem considering AGV transport time through multiple comparative experiments.
Author supplied keywords
Cite
CITATION STYLE
Wen, X., Zhang, H., Li, H., Wang, H., Ming, W., Zhang, Y., & Zhang, L. (2024). Fusion Q-Learning Algorithm for Open Shop Scheduling Problem with AGVs. Mathematics, 12(3). https://doi.org/10.3390/math12030452
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.