The emergence of Industry 4.0 allows for new approaches to solve industrial problems such as the Job Shop Scheduling Problem. It has been demonstrated that Multi-Agent Reinforcement Learning approaches are highly promising to handle complex scheduling scenarios. In this work we propose a user friendly Multi-Agent Reinforcement Learning tool, more appealing for industry. It allows the users to interact with the learning algorithms in such a way that all the constraints in the production floor are carefully included and the objectives can be adapted to real world scenarios. The user can either keep the best schedule obtained by a Q-Learning algorithm or adjust it by fixing some operations in order to meet certain constraints, then the tool will optimize the modified solution respecting the user preferences using two possible alternatives. These alternatives are validated using OR-Library benchmarks, the experiments show that the modified Q-Learning algorithm is able to obtain the best results.
CITATION STYLE
Martínez Jiménez, Y., Coto Palacio, J., & Nowé, A. (2020). Multi-agent reinforcement learning tool for job shop scheduling problems. In Communications in Computer and Information Science (Vol. 1173 CCIS, pp. 3–12). Springer. https://doi.org/10.1007/978-3-030-41913-4_1
Mendeley helps you to discover research relevant for your work.