Opening book details…
Can I read A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems on EtoBox?
A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems by M. Saqlain; S. Ali; J. Y. Lee is a Engineering article available to read on EtoBox.
What is A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems about?
Flexible job-shop scheduling problem (FJSP) is an extension of the simple JSP with additional features of routing flexibility. It is an essential class of sequencing and planning problems that can apply in many real-life applications, especially in the field of manufacturing systems and production management. Finding a scheduling solution of sequential operations of various jobs by processing them on a defined number of machines and following various constraints with the goal to minimize the completion time of all operations, known as Makespan, is a big challenging issue. To address this issue, we proposed a Monte Carlo Tree Search-based flexible jobshop scheduling algorithm called MCTS-FJS for scheduling highly complex jobs in a real-time job-shop environment. An MCTS is a tree search technique aimed at making sequential decisions with uncertainty, calculate reward values from sub-tees, and regularly explore the most promising sub-tree. Experimental results showed that MCTS-scheduler outperformed various baseline scheduling algorithms and got the best evaluation performance for our sample dataset. More importantly, results showed that the performance of the proposed algorithm impr
Who reads A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- M. Saqlain; S. Ali; J. Y. Lee
- Publisher
- Springer Science and Business Media LLC
- Published
- 2022
- Language
- EN
- Field
- Engineering (Physical Sciences)