IDEAS home Printed from https://ideas.repec.org/a/spr/gjofsm/v26y2025i1d10.1007_s40171-024-00427-7.html
   My bibliography  Save this article

Reconfigurable and Resilient Closed-Loop Supply Chain Design: A Simulation–Optimization Approach

Author

Listed:
  • Hadi Gholizadeh

    (Université Laval)

  • Amirabbas Pasha

    (Mazandaran University of Science and Technology)

  • Taha-Hossein Hejazi

    (Amirkabir University of Technology)

  • Hamed Jahani

    (RMIT University)

Abstract

This study develops a dynamic, multi-product, multi-period, and multi-stage framework for a reconfigurable closed-loop supply chain in the dairy sector, with a strong emphasis on flexibility. The model effectively manages fluctuating demand by optimizing production, transportation, inventory, and queuing delays while considering warehouse queue lengths and constraints. A simulation-based optimization approach, integrated with response surface methodology, is employed to determine optimal resource capacities and batch sizes, enhancing the system's flexibility in terms of reconfigurability, resilience and responsiveness to market shifts. The results highlight a 13% improvement in new product development flexibility and a 30% increase in adaptability to consumer demand. Furthermore, the model demonstrates a reduction in unmet customer demand and orders by 37% and 25%, respectively, compared to the current system, underscoring its effectiveness in improving both supply chain performance and flexibility.

Suggested Citation

  • Hadi Gholizadeh & Amirabbas Pasha & Taha-Hossein Hejazi & Hamed Jahani, 2025. "Reconfigurable and Resilient Closed-Loop Supply Chain Design: A Simulation–Optimization Approach," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 26(1), pages 85-113, March.
    • Handle: RePEc:spr:gjofsm:v:26:y:2025:i:1:d:10.1007_s40171-024-00427-7
    DOI: 10.1007/s40171-024-00427-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40171-024-00427-7
    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/s40171-024-00427-7?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.

    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:gjofsm:v:26:y:2025:i:1:d:10.1007_s40171-024-00427-7. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.