Intelligent Scheduling with Reinforcement Learning

被引:15
作者
Cunha, Bruno [1 ,2 ]
Madureira, Ana [1 ,2 ,3 ]
Fonseca, Benjamim [4 ,5 ]
Matos, Joao [2 ,6 ]
机构
[1] ISRC Interdisciplinary Studies Res Ctr, P-4200072 Porto, Portugal
[2] Polytech Porto ISEP P PORTO, Inst Engn, P-4200072 Porto, Portugal
[3] INOV Inst Engn Sistemas & Comp Inovacao, P-1000029 Lisbon, Portugal
[4] INESC TEC, P-5000801 Vila Real, Portugal
[5] Univ Tras Os Montes & Alto Douro UTAD, P-5000801 Vila Real, Portugal
[6] LEMA Lab Math Engn, P-4200072 Porto, Portugal
来源
APPLIED SCIENCES-BASEL | 2021年 / 11卷 / 08期
关键词
machine learning; reinforcement learning; optimization; Job Shop scheduling; simulation; SHOP; ALGORITHM; GAME; GO;
D O I
10.3390/app11083710
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In this paper, we present and discuss an innovative approach to solve Job Shop scheduling problems based on machine learning techniques. Traditionally, when choosing how to solve Job Shop scheduling problems, there are two main options: either use an efficient heuristic that provides a solution quickly, or use classic optimization approaches (e.g., metaheuristics) that take more time but will output better solutions, closer to their optimal value. In this work, we aim to create a novel architecture that incorporates reinforcement learning into scheduling systems in order to improve their overall performance and overcome the limitations that current approaches present. It is also intended to investigate the development of a learning environment for reinforcement learning agents to be able to solve the Job Shop scheduling problem. The reported experimental results and the conducted statistical analysis conclude about the benefits of using an intelligent agent created with reinforcement learning techniques. The main contribution of this work is proving that reinforcement learning has the potential to become the standard method whenever a solution is necessary quickly, since it solves any problem in very few seconds with high quality, approximate to the optimal methods.
引用
收藏
页数:22
相关论文
共 65 条
[31]   Due date optimization in multi-objective scheduling of flexible job shop production [J].
Ojstersek, R. ;
Tang, M. ;
Buchmeister, B. .
ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT, 2020, 15 (04) :481-492
[32]   An algorithm for the job shop scheduling problem based on global equilibrium search techniques [J].
Pardalos P.M. ;
Shylo O.V. .
Computational Management Science, 2006, 3 (4) :331-348
[33]  
Pedregosa F, 2011, J MACH LEARN RES, V12, P2825
[34]   A tabu search/path relinking algorithm to solve the job shop scheduling problem [J].
Peng, Bo ;
Lu, Zhipeng ;
Cheng, T. C. E. .
COMPUTERS & OPERATIONS RESEARCH, 2015, 53 :154-164
[35]  
Pinedo M., 2016, Scheduling: Theory, Algorithms, and Systems, V5th, DOI DOI 10.1007/978-3-319-26580-3
[36]  
Rand G. K., 2006, J OPER RES SOC, DOI [10.2307/2581219, DOI 10.2307/2581219]
[37]  
Raschka S., 2019, PYTHON MACHINE LEARN, V3rd
[38]   Nonlinear dimensionality reduction by locally linear embedding [J].
Roweis, ST ;
Saul, LK .
SCIENCE, 2000, 290 (5500) :2323-+
[39]  
SAMUEL AL, 1959, IBM J RES DEV, V3, P211, DOI 10.1147/rd.441.0206
[40]  
Schulman J., 2017, PREPRINT