IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v54y2007i6p623-631.html
   My bibliography  Save this article

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

Author

Listed:
  • Xiuli Chao
  • Sean X. Zhou

Abstract

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007

Suggested Citation

  • Xiuli Chao & Sean X. Zhou, 2007. "Probabilistic solution and bounds for serial inventory systems with discounted and average costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 623-631, September.
    • Handle: RePEc:wly:navres:v:54:y:2007:i:6:p:623-631
    DOI: 10.1002/nav.20234
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20234
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20234?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
    ---><---

    References listed on IDEAS

    as
    1. Kevin H. Shang & Jing-Sheng Song, 2003. "Newsvendor Bounds and Heuristic for Optimal Policies in Serial Supply Chains," Management Science, INFORMS, vol. 49(5), pages 618-638, May.
    2. Guillermo Gallego & Paul Zipkin, 1999. "Stock Positioning and Performance Estimation in Serial Production-Transportation Systems," Manufacturing & Service Operations Management, INFORMS, vol. 1(1), pages 77-88.
    3. Kaj Rosling, 1989. "Optimal Inventory Policies for Assembly Systems Under Random Demands," Operations Research, INFORMS, vol. 37(4), pages 565-579, August.
    4. Lingxiu Dong & Hau L. Lee, 2003. "Optimal Policies and Approximations for a Serial Multiechelon Inventory System with Time-Correlated Demand," Operations Research, INFORMS, vol. 51(6), pages 969-980, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sean X. Zhou & Xiuli Chao, 2010. "Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 71-87, February.
    2. Xiuli Chao & Sean X. Zhou, 2009. "Optimal Policy for a Multiechelon Inventory System with Batch Ordering and Fixed Replenishment Intervals," Operations Research, INFORMS, vol. 57(2), pages 377-390, April.
    3. Retsef Levi & Robin Roundy & Van Anh Truong & Xinshang Wang, 2017. "Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 256-276, January.
    4. Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2016. "Capacitated Multiechelon Inventory Systems: Policies and Bounds," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 570-584, October.
    5. Li Chen & Jing-Sheng Song & Yue Zhang, 2017. "Serial Inventory Systems with Markov-Modulated Demand: Derivative Bounds, Asymptotic Analysis, and Insights," Operations Research, INFORMS, vol. 65(5), pages 1231-1249, October.
    6. Warsing, Donald P. & Wangwatcharakul, Worawut & King, Russell E., 2019. "Computing base-stock levels for a two-stage supply chain with uncertain supply," Omega, Elsevier, vol. 89(C), pages 92-109.
    7. Tong Wang & Xiaoyue Yan & Chaolin Yang, 2021. "Managing a Hybrid RDC‐DC Inventory System," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3679-3697, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Kok, Ton & Grob, Christopher & Laumanns, Marco & Minner, Stefan & Rambau, Jörg & Schade, Konrad, 2018. "A typology and literature review on stochastic multi-echelon inventory models," European Journal of Operational Research, Elsevier, vol. 269(3), pages 955-983.
    2. Li Chen & Jing-Sheng Song & Yue Zhang, 2017. "Serial Inventory Systems with Markov-Modulated Demand: Derivative Bounds, Asymptotic Analysis, and Insights," Operations Research, INFORMS, vol. 65(5), pages 1231-1249, October.
    3. Lingxiu Dong & Hau L. Lee, 2003. "Optimal Policies and Approximations for a Serial Multiechelon Inventory System with Time-Correlated Demand," Operations Research, INFORMS, vol. 51(6), pages 969-980, December.
    4. Ming Hu & Yi Yang, 2014. "Modified Echelon ( r, Q ) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems," Operations Research, INFORMS, vol. 62(4), pages 812-828, August.
    5. Retsef Levi & Robin Roundy & Van Anh Truong & Xinshang Wang, 2017. "Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 256-276, January.
    6. Sean X. Zhou & Xiuli Chao, 2010. "Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 71-87, February.
    7. Diwakar Gupta & N. Selvaraju, 2006. "Performance Evaluation and Stock Allocation in Capacitated Serial Supply Systems," Manufacturing & Service Operations Management, INFORMS, vol. 8(2), pages 169-191, July.
    8. Peter Berling & Victor Martínez‐de‐Albéniz, 2016. "A characterization of optimal base‐stock levels for a multistage serial supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(1), pages 32-46, February.
    9. Kevin H. Shang, 2012. "Single-Stage Approximations for Optimal Policies in Serial Inventory Systems with Nonstationary Demand," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 414-422, July.
    10. Jing-Sheng Song & Paul Zipkin, 2013. "Supply Streams," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 444-457, July.
    11. Barnes-Schuster, Dawn & Bassok, Yehuda & Anupindi, Ravi, 2006. "Optimizing delivery lead time/inventory placement in a two-stage production/distribution system," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1664-1684, November.
    12. Tamer Boyaci & Guillermo Gallego, 2001. "Serial Production/Distribution Systems Under Service Constraints," Manufacturing & Service Operations Management, INFORMS, vol. 3(1), pages 43-50, June.
    13. Emilio Carrizosa & Alba V. Olivares-Nadal & Pepa Ramírez-Cobo, 2020. "Embedding the production policy in location-allocation decisions," 4OR, Springer, vol. 18(3), pages 357-380, September.
    14. Stephen C. Graves & Sean P. Willems, 2000. "Optimizing Strategic Safety Stock Placement in Supply Chains," Manufacturing & Service Operations Management, INFORMS, vol. 2(1), pages 68-83, June.
    15. Vanteddu, Gangaraju & Chinnam, Ratna Babu & Gushikin, Oleg, 2011. "Supply chain focus dependent supplier selection problem," International Journal of Production Economics, Elsevier, vol. 129(1), pages 204-216, January.
    16. Matthew J. Sobel & Volodymyr Babich, 2012. "Optimality of Myopic Policies for Dynamic Lot-Sizing Problems in Serial Production Lines with Random Yields and Autoregressive Demand," Operations Research, INFORMS, vol. 60(6), pages 1520-1536, December.
    17. Jing‐Sheng Song & Paul H. Zipkin, 2012. "Newsvendor problems with sequentially revealed demand information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 601-612, December.
    18. Alp Muharremoglu & John N. Tsitsiklis, 2008. "A Single-Unit Decomposition Approach to Multiechelon Inventory Systems," Operations Research, INFORMS, vol. 56(5), pages 1089-1103, October.
    19. Tan Wang & L. Jeff Hong, 2023. "Large-Scale Inventory Optimization: A Recurrent Neural Networks–Inspired Simulation Approach," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 196-215, January.
    20. Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2016. "Capacitated Multiechelon Inventory Systems: Policies and Bounds," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 570-584, October.

    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:wly:navres:v:54:y:2007:i:6:p:623-631. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.