IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i1p358-377.html
   My bibliography  Save this article

Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources

Author

Listed:
  • Jiashuo Jiang

    (Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Hong Kong, China)

  • Shixin Wang

    (Department of Decision Sciences and Managerial Economics, CUHK Business School, Chinese University of Hong Kong, Hong Kong, China)

  • Jiawei Zhang

    (Department of Technology, Operations and Statistics, Stern School of Business, New York University, New York, New York 10012)

Abstract

Resource pooling is a fundamental concept that has many applications in operations management for reducing and hedging uncertainty. An important problem in resource pooling is to decide (1) the capacity level of pooled resources in anticipation of random demand of multiple customers and (2) how the capacity should be allocated to fulfill customer demands after demand realization. In this paper, we present a general framework to study this two-stage problem when customers require individual and possibly different service levels. Our modeling framework generalizes and unifies many existing models in the literature and includes second-stage allocation costs. We propose a simple randomized rationing policy for any fixed feasible capacity level. Our main result is the optimality of this policy for very general service level constraints, including type I and type II constraints and beyond. The result follows from a semi-infinite linear programming formulation of the problem and its dual. As a corollary, we also prove the optimality of index policies for a large class of problems when the set of feasible fulfilled demands is a polymatroid.

Suggested Citation

  • Jiashuo Jiang & Shixin Wang & Jiawei Zhang, 2023. "Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources," Operations Research, INFORMS, vol. 71(1), pages 358-377, January.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:1:p:358-377
    DOI: 10.1287/opre.2022.2386
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2386
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.2386?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:oropre:v:71:y:2023:i:1:p:358-377. 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.