Open AccessPARALLEL MACHINE SCHEDULING WITH MONTE CARLO TREE SEARCH
Author(s) -
Anita Agárdi,
Károly Nehéz
Publication year - 2021
Publication title -
acta polytechnica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.207
H-Index - 15
eISSN - 1805-2363
pISSN - 1210-2709
DOI - 10.14311/ap.2021.61.0307
Subject(s) - computer science , monte carlo method , monte carlo tree search , scheduling (production processes) , mathematical optimization , algorithm , job shop scheduling , simulated annealing , mathematics , schedule , statistics , operating system
In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Machine Sequence Setup Times, Due Dates and Maintenance Times is presented. In this article after the introduction and literature review the mathematical model of the Parallel Machines Scheduling Problem with Job and Machine Sequence Setup Times, Due Dates and Maintenance Times is presented. After that the Monte Carlo Tree Search and Simulated Annealing are detailed. Our representation technique and its evaluation are also introduced. After that, the efficiency of the algorithms is tested with benchmark data, which result, that algorithms are suitable for solving production scheduling problems. In this article, after the literature review, a suitable mathematical model is presented. The problem is solved with a specific Monte Carlo Tree Search (MCTS) algorithm, which uses a neighbourhood search method (2-opt). In the article, we present the efficiency of our Iterative Monte Carlo Tree Search (IMCTS) algorithm on randomly generated datasets.