IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v496y2025ics0096300325000700.html
   My bibliography  Save this article

Aspects on the optimal decoupling point setting problem

Author

Listed:
  • Jodlbauer, Herbert
  • Dehmer, Matthias
  • Emmert-Streib, Frank

Abstract

Demand-Driven Material Requirement Planning (DDMRP) represents a combination of traditional Material Requirements Planning (MRP) and the reorder point method. A key consideration in DDMRP revolves around determining the optimal position of decoupling points, also referred to as strategic inventory positions. This article addresses the question of where these decoupling points should be strategically positioned, utilizing a directed universal graph derived from the Bill of Materials (BOM) to formalize the optimal decoupling point setting problem. To address this challenge, analytical formulas are developed. The analytical formulas utilize parameters such as delivery time, demand variance, replenishment time, lot sizes, holding costs, and service levels. These formulas provide insights into key characteristics of optimal decoupling points. The obtained results can be categorized into arguments advocating for decoupling points to be positioned either more upstream or more downstream. Furthermore, we derive specific characteristics that an optimal decoupling point position should possess. This research contributes valuable knowledge for practitioners seeking to enhance the efficiency and effectiveness of their DDMRP implementation.

Suggested Citation

  • Jodlbauer, Herbert & Dehmer, Matthias & Emmert-Streib, Frank, 2025. "Aspects on the optimal decoupling point setting problem," Applied Mathematics and Computation, Elsevier, vol. 496(C).
    • Handle: RePEc:eee:apmaco:v:496:y:2025:i:c:s0096300325000700
    DOI: 10.1016/j.amc.2025.129343
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325000700
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129343?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:eee:apmaco:v:496:y:2025:i:c:s0096300325000700. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.