IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v35y2024i8d10.1007_s10845-023-02309-8.html
   My bibliography  Save this article

Multi agent reinforcement learning for online layout planning and scheduling in flexible assembly systems

Author

Listed:
  • Lea Kaven

    (Laboratory for Machine Tools and Production Engineering (WZL) of RWTH Aachen University)

  • Philipp Huke

    (Laboratory for Machine Tools and Production Engineering (WZL) of RWTH Aachen University)

  • Amon Göppert

    (Laboratory for Machine Tools and Production Engineering (WZL) of RWTH Aachen University)

  • Robert H. Schmitt

    (Laboratory for Machine Tools and Production Engineering (WZL) of RWTH Aachen University
    Fraunhofer Institute for Production Technology IPT)

Abstract

Manufacturing systems are undergoing systematic change facing the trade-off between the customer's needs and the economic and ecological pressure. Especially assembly systems must be more flexible due to many product generations or unpredictable material and demand fluctuations. As a solution line-less mobile assembly systems implement flexible job routes through movable multi-purpose resources and flexible transportation systems. Moreover, a completely reactive rearrangeable layout with mobile resources enables reconfigurations without interrupting production. A scheduling that can handle the complexity of dynamic events is necessary to plan job routes and control transportation in such an assembly system. Conventional approaches for this control task require exponentially rising computational capacities with increasing problem sizes. Therefore, the contribution of this work is an algorithm to dynamically solve the integrated problem of layout optimization and scheduling in line-less mobile assembly systems. The proposed multi agent deep reinforcement learning algorithm uses proximal policy optimization and consists of a decoder and encoder, allowing for various-sized system state descriptions. A simulation study shows that the proposed algorithm performs better in 78% of the scenarios compared to a random agent regarding the makespan optimization objective. This allows for adaptive optimization of line-less mobile assembly systems that can face global challenges.

Suggested Citation

  • Lea Kaven & Philipp Huke & Amon Göppert & Robert H. Schmitt, 2024. "Multi agent reinforcement learning for online layout planning and scheduling in flexible assembly systems," Journal of Intelligent Manufacturing, Springer, vol. 35(8), pages 3917-3936, December.
    • Handle: RePEc:spr:joinma:v:35:y:2024:i:8:d:10.1007_s10845-023-02309-8
    DOI: 10.1007/s10845-023-02309-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-023-02309-8
    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/s10845-023-02309-8?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. Byeongseop Kim & Yongkuk Jeong & Jong Gye Shin, 2020. "Spatial arrangement using deep reinforcement learning to minimise rearrangement in ship block stockyards," International Journal of Production Research, Taylor & Francis Journals, vol. 58(16), pages 5062-5076, July.
    2. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    3. Meir J. Rosenblatt, 1986. "The Dynamics of Plant Layout," Management Science, INFORMS, vol. 32(1), pages 76-86, January.
    4. Azalia Mirhoseini & Anna Goldie & Mustafa Yazgan & Joe Wenjie Jiang & Ebrahim Songhori & Shen Wang & Young-Joon Lee & Eric Johnson & Omkar Pathak & Azade Nova & Jiwoo Pak & Andy Tong & Kavya Srinivasa, 2021. "A graph placement methodology for fast chip design," Nature, Nature, vol. 594(7862), pages 207-212, June.
    5. Junyoung Park & Jaehyeong Chun & Sang Hun Kim & Youngkook Kim & Jinkyoo Park, 2021. "Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning," International Journal of Production Research, Taylor & Francis Journals, vol. 59(11), pages 3360-3377, June.
    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. Alexandre Dolgui & Hichem Haddou Benderbal & Fabio Sgarbossa & Simon Thevenin, 2024. "Editorial for the special issue: AI and data-driven decisions in manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 35(8), pages 3599-3604, December.

    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. Chen, Ziyue & Huang, Lizhen, 2021. "Digital twins for information-sharing in remanufacturing supply chain: A review," Energy, Elsevier, vol. 220(C).
    2. Yifei Zhao & Stein W. Wallace, 2016. "Appraising redundancy in facility layout," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 665-679, February.
    3. Balakrishnan, Jaydeep & Cheng, Chun Hung & Conway, Daniel G. & Lau, Chun Ming, 2003. "A hybrid genetic algorithm for the dynamic plant layout problem," International Journal of Production Economics, Elsevier, vol. 86(2), pages 107-120, November.
    4. Masoud Zafarzadeh & Magnus Wiktorsson & Jannicke Baalsrud Hauge, 2021. "A Systematic Review on Technologies for Data-Driven Production Logistics: Their Role from a Holistic and Value Creation Perspective," Logistics, MDPI, vol. 5(2), pages 1-32, April.
    5. Zigao Wu & Shaohua Yu & Tiancheng Li, 2019. "A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling," Mathematics, MDPI, vol. 7(6), pages 1-19, June.
    6. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    7. Vivek Warke & Satish Kumar & Arunkumar Bongale & Ketan Kotecha, 2021. "Sustainable Development of Smart Manufacturing Driven by the Digital Twin Framework: A Statistical Analysis," Sustainability, MDPI, vol. 13(18), pages 1-49, September.
    8. Hajkowicz, Stefan & Naughtin, Claire & Sanderson, Conrad & Schleiger, Emma & Karimi, Sarvnaz & Bratanova, Alexandra & Bednarz, Tomasz, 2022. "Artificial intelligence for science – adoption trends and future development pathways," MPRA Paper 115464, University Library of Munich, Germany.
    9. Xuan Jing & Xifan Yao & Min Liu & Jiajun Zhou, 2024. "Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 35(1), pages 75-93, January.
    10. Gregory A. Kasapidis & Dimitris C. Paraskevopoulos & Panagiotis P. Repoussis & Christos D. Tarantilis, 2021. "Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4044-4068, November.
    11. A Başar & B Çatay & T Ünlüyurt, 2011. "A multi-period double coverage approach for locating the emergency medical service stations in Istanbul," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 627-637, April.
    12. Zhang, Jingwen & Li, Lubo & Demeulemeester, Erik & Zhang, Haohua, 2024. "A three-dimensional spatial resource-constrained project scheduling problem: Model and heuristic," European Journal of Operational Research, Elsevier, vol. 319(3), pages 943-966.
    13. Vid Tomljenovic & Yasemin Merzifonluoglu & Giacomo Spigler, 2024. "Optimizing inland container shipping through reinforcement learning," Annals of Operations Research, Springer, vol. 339(1), pages 1025-1050, August.
    14. Balakrishnan, Jaydeep & Cheng, Chun Hung, 2006. "A note on "a hybrid genetic algorithm for the dynamic plant layout problem"," International Journal of Production Economics, Elsevier, vol. 103(1), pages 87-89, September.
    15. Kandula, Shanthan & Krishnamoorthy, Srikumar & Roy, Debjit, 2021. "Learning to Play the Box-Sizing Game: A Machine Learning Approach for Solving the E-commerce Packaging Problem," IIMA Working Papers WP 2021-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. R. Micale & C. M. La Fata & M. Enea & G. La Scalia, 2021. "Regenerative scheduling problem in engineer to order manufacturing: an economic assessment," Journal of Intelligent Manufacturing, Springer, vol. 32(7), pages 1913-1925, October.
    17. Yu-Hsin Chen, Gary, 2013. "A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems," International Journal of Production Economics, Elsevier, vol. 142(2), pages 362-371.
    18. Liu, Jingfa & Wang, Dawen & He, Kun & Xue, Yu, 2017. "Combining Wang–Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1052-1063.
    19. Saif Benjaafar & Sunderesh S. Heragu & Shahrukh A. Irani, 2002. "Next Generation Factory Layouts: Research Challenges and Recent Progress," Interfaces, INFORMS, vol. 32(6), pages 58-76, December.
    20. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.

    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:joinma:v:35:y:2024:i:8:d:10.1007_s10845-023-02309-8. 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.