IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/v16y2012i3p19-26.html
   My bibliography  Save this article

Exact Fill Rates for the (R, S) Inventory Control with Discrete Distributed Demands for the Backordering Case

Author

Listed:
  • Eugenia BABILONI
  • Ester GUIJARRO
  • Manuel CARDÓS
  • Sofía ESTELLÉS

Abstract

The fill rate is usually computed by using the traditional approach, which calculates it as the complement of the quotient between the expected unfulfilled demand and the expected demand per replenishment cycle, instead of directly the expected fraction of fulfilled demand. Furthermore the available methods to estimate the fill rate apply only under specific demand conditions. This paper shows the research gap regarding the estimation procedures to compute the fill rate and suggests: (i) a new exact procedure to compute the traditional approximation for any discrete demand distribution; and (ii) a new method to compute the fill rate directly as the fraction of fulfilled demand for any discrete demand distribution. Simulation results show that the latter methods outperform the traditional approach, which underestimates the simulated fill rate, over different demand patterns. This paper focuses on the traditional periodic review, base stock system when backlogged demands are allowed.

Suggested Citation

  • Eugenia BABILONI & Ester GUIJARRO & Manuel CARDÓS & Sofía ESTELLÉS, 2012. "Exact Fill Rates for the (R, S) Inventory Control with Discrete Distributed Demands for the Backordering Case," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 16(3), pages 19-26.
    • Handle: RePEc:aes:infoec:v:16:y:2012:i:3:p:19-26
    as

    Download full text from publisher

    File URL: http://www.revistaie.ase.ro/content/63/02%20-%20Babiloni.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. van der Heijden, Matthieu, 2000. "Near cost-optimal inventory control policies for divergent networks under fill rate constraints," International Journal of Production Economics, Elsevier, vol. 63(2), pages 161-179, January.
    2. Edward A. Silver, 1981. "Operations Research in Inventory Management: A Review and Critique," Operations Research, INFORMS, vol. 29(4), pages 628-645, August.
    3. Tempelmeier, Horst, 2007. "On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 181(1), pages 184-194, August.
    Full references (including those not matched with items on IDEAS)

    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. Noordhoek, Marije & Dullaert, Wout & Lai, David S.W. & de Leeuw, Sander, 2018. "A simulation–optimization approach for a service-constrained multi-echelon distribution network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 292-311.
    2. Mahmut Parlar & David Perry, 1996. "Inventory models of future supply uncertainty with single and multiple suppliers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 191-210, March.
    3. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    4. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    5. Kilic, Onur A. & Tunc, Huseyin & Tarim, S. Armagan, 2018. "Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1102-1109.
    6. Li, Zhaolin & Ou, Jinwen & Liang, Guitian, 2021. "Optimizing hospital drug procurement with rebate contracts," Omega, Elsevier, vol. 105(C).
    7. Mahmut Parlar, 2000. "Probabilistic Analysis of Renewal Cycles: An Application to a Non-Markovian Inventory Problem with Multiple Objectives," Operations Research, INFORMS, vol. 48(2), pages 243-255, April.
    8. Visentin, Andrea & Prestwich, Steven & Rossi, Roberto & Tarim, S. Armagan, 2021. "Computing optimal (R,s,S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming," European Journal of Operational Research, Elsevier, vol. 294(1), pages 91-99.
    9. Gurkan, M. Edib & Tunc, Huseyin & Tarim, S. Armagan, 2022. "The joint stochastic lot sizing and pricing problem," Omega, Elsevier, vol. 108(C).
    10. Shin Woong Sung & Young Jae Jang & Jung Hoon Kim & Juyeong Lee, 2017. "Business Analytics for Streamlined Assort Packing and Distribution of Fashion Goods at Kolon Sport," Interfaces, INFORMS, vol. 47(6), pages 555-573, December.
    11. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    12. Kumar, Anupam & Evers, Philip T., 2015. "Setting safety stock based on imprecise records," International Journal of Production Economics, Elsevier, vol. 169(C), pages 68-75.
    13. Xiaoling Zhang & Ke Zhang & Shibo Li & Damien Koenitz, 2023. "Effects of store fixture shape at retail checkout: Evidence from field and online studies," Production and Operations Management, Production and Operations Management Society, vol. 32(10), pages 3158-3173, October.
    14. Vikram Tiwari & Srinagesh Gavirneni, 2007. "ASP, The Art and Science of Practice: Recoupling Inventory Control Research and Practice: Guidelines for Achieving Synergy," Interfaces, INFORMS, vol. 37(2), pages 176-186, April.
    15. Céline Gicquel & Jianqiang Cheng, 2018. "A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand," Annals of Operations Research, Springer, vol. 264(1), pages 123-155, May.
    16. Abbasi, B. & Hosseinifard, Z. & Alamri, O. & Thomas, D. & Minas, J.P., 2018. "Finite time horizon fill rate analysis for multiple customer cases," Omega, Elsevier, vol. 76(C), pages 1-17.
    17. Heiner Ackermann & Erik Diessel & Michael Helmling & Neil Jami & Johanna Münch, 2024. "Computing Optimal Mitigation Plans for Force-Majeure Scenarios in Dynamic Manufacturing Chains," SN Operations Research Forum, Springer, vol. 5(2), pages 1-35, June.
    18. Tarim, S. Armagan & Dogru, Mustafa K. & Özen, Ulas & Rossi, Roberto, 2011. "An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints," European Journal of Operational Research, Elsevier, vol. 215(3), pages 563-571, December.
    19. Kilic, Onur A. & Tarim, S. Armagan, 2024. "A simple heuristic for computing non-stationary inventory policies based on function approximation," European Journal of Operational Research, Elsevier, vol. 316(3), pages 899-905.
    20. Choudhary, Devendra & Shankar, Ravi, 2015. "The value of VMI beyond information sharing in a single supplier multiple retailers supply chain under a non-stationary (Rn, Sn) policy," Omega, Elsevier, vol. 51(C), pages 59-70.

    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:aes:infoec:v:16:y:2012:i:3:p:19-26. 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: Paul Pocatilu (email available below). General contact details of provider: https://edirc.repec.org/data/aseeero.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.