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

Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs

Author

Listed:
  • Han Zhu

    (School of Management Science and Engineering, Dongbei University of Finance and Economics, Dalian, Liaoning 116025, China)

  • Youhua (Frank) Chen

    (Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong)

  • Ming Hu

    (Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada)

  • Yi Yang

    (School of Management, Zhejiang University, Hangzhou, Zhejiang 310027, China)

Abstract

We study a continuous-review, two-echelon inventory system with one central warehouse, multiple local facilities, and each facility facing random demand. Local facilities replenish their stock from the central warehouse (or distribution center), which in turn places orders at an outside supplier with ample supply. Inventory replenishment at each location incurs a fixed-plus-variable cost for each shipment. The optimal policy remains unknown, and even if it exists, such a policy must be extremely complicated. Instead, we evaluate a class of easy-to-implement heuristics, called modified echelon ( r, Q ) policies. The parameters for such a heuristic are obtained by solving a set of independent single-stage systems. We show that the proposed policy is asymptotically optimal, as pairs of system primitives, such as the ratios of the fixed cost of the central facility to those of the local facilities, are scaled up. We also show that as the number of retailers grows, the performance bound of the heuristic converges to a primitive-dependent constant.

Suggested Citation

  • Han Zhu & Youhua (Frank) Chen & Ming Hu & Yi Yang, 2021. "Technical Note–A Simple Heuristic Policy for Stochastic Distribution Inventory Systems with Fixed Shipment Costs," Operations Research, INFORMS, vol. 69(6), pages 1651-1659, November.
  • Handle: RePEc:inm:oropre:v:69:y:2021:i:6:p:1651-1659
    DOI: 10.1287/opre.2021.2101
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2021.2101?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:69:y:2021:i:6:p:1651-1659. 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.