IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v25y2023i2p581-594.html
   My bibliography  Save this article

Robust Inventory Management: A Cycle-Based Approach

Author

Listed:
  • Yupeng Chen

    (Division of Marketing, Nanyang Business School, Nanyang Technological University, Singapore 639798)

  • Garud Iyengar

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

  • Chun Wang

    (Department of Management Science and Engineering, School of Economics and Management, Tsinghua University, Beijing 100084, China)

Abstract

Problem definition : We study the robust formulation of an inventory model with positive fixed ordering costs, where the unfulfilled demand is either backlogged or lost, the lead time is allowed to be positive, the demand is potentially intertemporally correlated, and the information about the demand distribution is limited. Methodology/results : We propose a robust cycle-based policy that manages inventory by dividing the planning horizon into nonoverlapping inventory cycles, where an order is placed at the beginning of each cycle. Our policy selects the lengths and order quantities for all inventory cycles to minimize the worst-case total cost incurred over the planning horizon. When the uncertain demand belongs to a general polyhedral uncertainty set, the decisions in our policy can be computed by solving linear programs (LPs) for the backlogging model with any lead time and the lost-sales model with zero lead time; however, the number of LPs that need to be solved grows exponentially in the length of the planning horizon. In the special case where the uncertain demand belongs to a box uncertainty set, the decisions in our policy can be computed using a dynamic programming (DP) recursion whose complexity grows polynomially in the length of the planning horizon. We also propose a one-cycle look-ahead heuristic to handle large problem instances with a general polyhedral uncertainty set. This heuristic can be applied for both the backlogging and lost-sales models with any lead time, and it only requires solving LPs whose number grows quadratically in the length of the planning horizon. Results from extensive computational experiments clearly show that both a rolling-cycle implementation of our policy and the one-cycle look-ahead heuristic have very strong empirical performance. Managerial implications : Our robust cycle-based policy and the one-cycle look-ahead heuristic are conceptually simple and can accommodate multiple realistic features in inventory management problems. They provide a very effective approach to robust inventory management, especially in the lost-sales setting.

Suggested Citation

  • Yupeng Chen & Garud Iyengar & Chun Wang, 2023. "Robust Inventory Management: A Cycle-Based Approach," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 581-594, March.
  • Handle: RePEc:inm:ormsom:v:25:y:2023:i:2:p:581-594
    DOI: 10.1287/msom.2022.1168
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.1168
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.1168?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
    ---><---

    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:inm:ormsom:v:25:y:2023:i:2:p:581-594. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.