IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i22p6824-6845.html
   My bibliography  Save this article

Robust material requirement planning with cumulative demand under uncertainty

Author

Listed:
  • Romain Guillaume
  • Caroline Thierry
  • Paweł Zieliński

Abstract

In this paper, we deal with the problem of tactical capacitated production planning with the demand under uncertainty modelled by closed intervals. We propose a single-item with backordering model under small uncertainty in the cumulative demand for the Master Production Scheduling (MPS) problem with different rules, namely the Lot For Lot rule and the Periodic Order Quantity rule. Then we study a general multilevel, multi-item, multi-resource model with backordering and the external demand on components for the Material Requirement Planning (MRP) problem under uncertainty in the cumulative demand. In order to choose robust production plans for the above problems that hedge against uncertainty, we adopt the well-known minmax criterion. We propose polynomial methods for evaluating the impact of uncertainty on a given production plan in terms of its cost and for computing optimal robust production plans for both problems (MPS/MRP) under the assumed interval uncertainty representation. We show in this way that the robust problems (MPS/MRP) under this uncertainty representation are not much computationally harder than their deterministic counterparts.

Suggested Citation

  • Romain Guillaume & Caroline Thierry & Paweł Zieliński, 2017. "Robust material requirement planning with cumulative demand under uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6824-6845, November.
  • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:22:p:6824-6845
    DOI: 10.1080/00207543.2017.1353157
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1353157
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2017.1353157?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.

    Citations

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


    Cited by:

    1. Li, Yuchen & Saldanha-da-Gama, Francisco & Liu, Ming & Yang, Zaoli, 2023. "A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 304(1), pages 353-365.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:55:y:2017:i:22:p:6824-6845. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.