IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v37y2025i2d10.1007_s10696-024-09536-y.html
   My bibliography  Save this article

A first optimization approach to parameterize demand-driven MRP in the presence of multiple products and finite capacity

Author

Listed:
  • David Damand

    (EM Strasbourg Business School)

  • Youssef Lahrichi

    (ISCAE)

  • Marc Barth

    (EM Strasbourg Business School)

Abstract

Demand-Driven Material Requirements Planning (DDMRP) is a promising production planning and control system that first appeared in 2011. The main novelty of DDMRP is that it protects critical references with buffer stocks and generates replenishment orders based on real-time demand and stock. Many scholars have studied its performance relative to more established production planning systems and demonstrated its competitiveness. More recently, studies dealing with the parameterization of Demand-Driven MRP have emerged. These papers present algorithms to fix DDMRP parameters with the objective of maximizing the On-Time Delivery (OTD) that is the percentage of customer orders delivered on-time or minimizing the average on-hand inventory. These studies all consider either a single reference or multiple references without managing conflicts between references competing for a bottleneck resource. This paper presents a first study to parameterize DDMRP in the presence of multiple products and finite capacity. Capacity limitation is modeled as a limitation of WIP (work-in-progress). A multi-objective genetic algorithm, which we initially suggested for a single reference, is extended in this paper to multiple references and finite capacity. The optimization algorithm is tested and analyzed on 21 data instances with 10 references.

Suggested Citation

  • David Damand & Youssef Lahrichi & Marc Barth, 2025. "A first optimization approach to parameterize demand-driven MRP in the presence of multiple products and finite capacity," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 324-347, June.
    • Handle: RePEc:spr:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09536-y
    DOI: 10.1007/s10696-024-09536-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-024-09536-y
    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-024-09536-y?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:flsman:v:37:y:2025:i:2:d:10.1007_s10696-024-09536-y. 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.