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

Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint

Author

Listed:
  • Chen, Zhen
  • Archibald, Thomas W.

Abstract

This paper investigates a multi-period stochastic cash flow inventory problem with the aim of maximizing the long-term survival probability, which may be the objective of some retailers especially in periods of economic distress. Demand in each period is stochastic and can be non-stationary. In order to avoid too many lost sales under this objective, we introduce a joint chance constraint requiring the probability of no stockouts during the planning horizon to be higher than a specified service level. We develop a scenario-based model and a sample average approximation (SAA) model to solve the problem. A statistical upper bound on the survival probability based on SAA is provided and we discuss upper and lower bounds for the problem based on stochastic dynamic programming. We also propose a rolling horizon approach with service rate updating to test the out-of-sample performance of the two stochastic models and solve problems with long planning horizons. We test the two methods in large numerical tests and find that the rolling horizon approach together with the stochastic models can solve realistically sized problems in reasonable time.

Suggested Citation

  • Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).
    • Handle: RePEc:eee:proeco:v:270:y:2024:i:c:s0925527324000483
    DOI: 10.1016/j.ijpe.2024.109191
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527324000483
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2024.109191?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:proeco:v:270:y:2024:i:c:s0925527324000483. 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: http://www.elsevier.com/locate/ijpe .

    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.