IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v35y2023i2d10.1007_s10696-021-09437-4.html
   My bibliography  Save this article

A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems

Author

Listed:
  • M. Saqlain

    (Chungbuk National University)

  • S. Ali

    (Chungbuk National University)

  • J. Y. Lee

    (Chungbuk National University)

Abstract

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 job-shop 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 improved with increasing the number of jobs. Hence, this novel approach can be used to solve the complex FJSP in manufacturing systems.

Suggested Citation

  • M. Saqlain & S. Ali & J. Y. Lee, 2023. "A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems," Flexible Services and Manufacturing Journal, Springer, vol. 35(2), pages 548-571, June.
    • Handle: RePEc:spr:flsman:v:35:y:2023:i:2:d:10.1007_s10696-021-09437-4
    DOI: 10.1007/s10696-021-09437-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-021-09437-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-021-09437-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Abhijit Gosavi, 2009. "Reinforcement Learning: A Tutorial Survey and Recent Advances," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 178-192, May.
    2. Marwin H. S. Segler & Mike Preuss & Mark P. Waller, 2018. "Planning chemical syntheses with deep neural networks and symbolic AI," Nature, Nature, vol. 555(7698), pages 604-610, March.
    3. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.
    4. Chiang, Tsung-Che & Lin, Hsiao-Jou, 2013. "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 87-98.
    5. Yuxia Cheng & Zhiwei Wu & Kui Liu & Qing Wu & Yu Wang, 2019. "Smart DAG Tasks Scheduling between Trusted and Untrusted Entities Using the MCTS Method," Sustainability, MDPI, vol. 11(7), pages 1-16, March.
    6. Christophe Sauvey & Wajdi Trabelsi & Nathalie Sauer, 2020. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems," Mathematics, MDPI, vol. 8(1), pages 1-17, January.
    7. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. William Motsch & Achim Wagner & Martin Ruskowski, 2024. "Autonomous Agent-Based Adaptation of Energy-Optimized Production Schedules Using Extensive-Form Games," Sustainability, MDPI, vol. 16(9), pages 1-30, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marcel Rolf Pfeifer, 2021. "Development of a Smart Manufacturing Execution System Architecture for SMEs: A Czech Case Study," Sustainability, MDPI, vol. 13(18), pages 1-23, September.
    2. Jia-Min Lu & Hui-Feng Wang & Qi-Hang Guo & Jian-Wei Wang & Tong-Tong Li & Ke-Xin Chen & Meng-Ting Zhang & Jian-Bo Chen & Qian-Nuan Shi & Yi Huang & Shao-Wen Shi & Guang-Yong Chen & Jian-Zhang Pan & Zh, 2024. "Roboticized AI-assisted microfluidic photocatalytic synthesis and screening up to 10,000 reactions per day," Nature Communications, Nature, vol. 15(1), pages 1-13, December.
    3. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    4. Voelkel, Michael A. & Sachs, Anna-Lena & Thonemann, Ulrich W., 2020. "An aggregation-based approximate dynamic programming approach for the periodic review model with random yield," European Journal of Operational Research, Elsevier, vol. 281(2), pages 286-298.
    5. Kumar, V.N.S.A. & Kumar, V. & Brady, M. & Garza-Reyes, Jose Arturo & Simpson, M., 2017. "Resolving forward-reverse logistics multi-period model using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 458-469.
    6. Tao Ren & Yan Zhang & Shuenn-Ren Cheng & Chin-Chia Wu & Meng Zhang & Bo-yu Chang & Xin-yue Wang & Peng Zhao, 2020. "Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates," Mathematics, MDPI, vol. 8(8), pages 1-25, July.
    7. Rossi, Andrea, 2014. "Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships," International Journal of Production Economics, Elsevier, vol. 153(C), pages 253-267.
    8. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    9. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    10. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    11. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    12. Naudé, Wim, 2020. "Artificial Intelligence against COVID-19: An Early Review," IZA Discussion Papers 13110, Institute of Labor Economics (IZA).
    13. Yanina Fumero & Gabriela Corsano & Jorge Montagna, 2012. "Planning and scheduling of multistage multiproduct batch plants operating under production campaigns," Annals of Operations Research, Springer, vol. 199(1), pages 249-268, October.
    14. Fang, Jianhao & Hu, Weifei & Liu, Zhenyu & Chen, Weiyi & Tan, Jianrong & Jiang, Zhiyu & Verma, Amrit Shankar, 2022. "Wind turbine rotor speed design optimization considering rain erosion based on deep reinforcement learning," Renewable and Sustainable Energy Reviews, Elsevier, vol. 168(C).
    15. Mingyang Wang & Shuai Li & Jike Wang & Odin Zhang & Hongyan Du & Dejun Jiang & Zhenxing Wu & Yafeng Deng & Yu Kang & Peichen Pan & Dan Li & Xiaorui Wang & Xiaojun Yao & Tingjun Hou & Chang-Yu Hsieh, 2024. "ClickGen: Directed exploration of synthesizable chemical space via modular reactions and reinforcement learning," Nature Communications, Nature, vol. 15(1), pages 1-18, December.
    16. Roux, O. & Duvivier, D. & Dhaevers, V. & Meskens, N. & Artiba, A., 2008. "Multicriteria approach to rank scheduling strategies," International Journal of Production Economics, Elsevier, vol. 112(1), pages 192-201, March.
    17. Farahmand, H. & Doorman, G.L., 2012. "Balancing market integration in the Northern European continent," Applied Energy, Elsevier, vol. 96(C), pages 316-326.
    18. Abdelrahman Hosny & Sherief Reda, 2024. "Automatic MILP solver configuration by learning problem similarities," Annals of Operations Research, Springer, vol. 339(1), pages 909-936, August.
    19. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    20. Stefansson, Hlynur & Sigmarsdottir, Sigrun & Jensson, Pall & Shah, Nilay, 2011. "Discrete and continuous time representations and mathematical models for large production scheduling problems: A case study from the pharmaceutical industry," European Journal of Operational Research, Elsevier, vol. 215(2), pages 383-392, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:flsman:v:35:y:2023:i:2:d:10.1007_s10696-021-09437-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.