Abstract
Within the framework of continuous-review \((S-1, S)\) inventory systems with rationing and backorders, there are two streams of studies in the literature that involve optimization models. In the first stream, service level optimizations are studied for which exact optimization routines are provided. The second stream of studies involves cost optimization models, which relies on optimizing approximate cost models rather than the original cost model. Our main contribution in this study is to fill this research gap by providing a computationally efficient and exact optimization algorithm for determining the optimal policy parameters which minimizes the expected cost rate per unit time. One important aspect of our method is that, as the base-stock level is increased by 1 as the iteration continues, the steady-state probabilities need to be calculated only once in our optimization routine (for which the rationing level equals to zero). For the given base-stock level, the cost measures of all other policy parameters can be computed immediately through the knowledge of the probabilities computed in previous iterations. This result significantly reduces the computational complexity of the optimization routine. In the numerical study section, we show the efficiency of the proposed optimization routine under varying system parameters. We also compare the performance of our approach with the existing heuristic in the literature and show that savings up to \(34.75 \%\) can be achieved.
Similar content being viewed by others
References
Arslan H, Graves SC, Roemar T (2007) A single-product inventory model for multiple demand classes. Manage Sci 53(9):1486–1500
Dekker R, Kleijn MJ, de Rooij PJ (1998) A spare parts stocking policy based on equipment criticality. Int J Prod Econ 56–57:69–77
Dekker R, Hill RM, Kleijn MJ, Teunter RH (2002) On the (S-1, S) lost sales inventory model with priority demand classes. Naval Res Logistics 49(6):593–610
Deshpande V, Cohen MA, Donohue K (2003) A threshold rationing policy for service differentiated demand classes. Manage Sci 49(6):683–703
Enders P, Adan I, Scheller-Wolf A et al (2014) Inventory rationing for a system with heterogeneous customer classes. Flex Serv Manuf J 26:344–386
Escalona P, Angulo A, Weston J, Stegmaier R, Kauak I (2019) On the effect of two populer sercice level measures on the design of a critical lebel policy for fast moving items. Comput Oper Res 107:107–126
Fadiloglu MM, Bulut O (2010) An embedded markov chain approach to stock rationing. Oper Res Lett 38(6):510–515
Gabor AF, van Vianen L, Yang G et al (2018) A base-stock inventory model with service differentiation and response time guarantees. Europ J Oper Res 269(3):900–908
Isotupa KPS (2015) Cost analysis of an (S-1, S) inventory system with two demand classes and rationing. Annals Oper Res 233(1):411–421
Koçaǧa YL, Şen A (2007) Spare parts inventory management with demand lead times and rationing. IIE Trans 39(9):879–898
Kranenburg AA, van Houtum GJ (2007) Cost optimization in the (S- 1, S) lost sales inventory model with multiple demand classes. Oper Res Lett 35(4):493–502
Melchiors P, Dekker R, Kleijn MJ (2000) Inventory rationing in an (s, Q) inventory model with lost sales and two demand classes. J Oper Res Soc 51(1):111–122
Moon I, Kang S (1998) Rationing policies for some inventory policies. J Oper Res Soc 49:509–518
Nahmias S, Demmy WS (1981) Operating characteristics of an inventory system with rationing. Manage Sci 27(11):1236–1245
Vicil O (2020) Optimizing stock levels for service-differentiated demand classes with inventory rationing and demand lead times. Advance online publication. Flex Serv Manuf J. https://doi.org/10.1007/s10696-020-09378-4
Vicil O (2021) Inventory rationing on a one-for-one inventory model for two priority customer classes with backorders and lost Sales. IISE Trans 53(4):472–495
Vicil O, Jackson P (2016) Computationally efficient optimization of stock pooling and allocation levels for two-demand-classes under general lead time distributions. IIE Trans 48(10):955–974
Vicil O, Jackson P (2018) Stock optimization for service differentiated demands with fill rate and waiting time requirements. Oper Res Lett 46(3):367–372
Wolff RW (1982) Poisson arrivals see time averages. Oper Res 30(2):223–231
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix: A Proof of Lemma 1
\(\square\)
Appendix: B Proof of Lemma 3
\(\square\)
Appendix: C Proof of Proposition 2
(12) follows directly from (6). The monotonicity relation in (13) has been established by Vicil and Jackson (2016) (Proposition 2).
Beginning from a regeneration point in which no orders are outstanding, let \((m,T_{m},E_{m})\) describe the \(m^{th}\) event in the system: \(T_{m}\) is the time of the \(m^{th}\) event, and \(E_{m}\) is the type of event where \(E_{m}\in \{``v",``c",``n"\}\) representing events "delivery", "critical class demand", and "non-critical class demand", respectively. Let \(R_{m}\) denote the number of units in resupply after the \(m^{th}\) event, \(B_{n,m}\) denote the number of non-critical class backorders after the \(m^{th}\) event, \(B_{c,m}\) denote the number of critical class backorders after the \(m^{th}\) event, and \(OH_{m}\) denote the physical stock after the \(m^{th}\) event. Let us consider two systems with identical event sequences \(\left\{ (m,T_{m},E_{m}); m=1,2,3,...\right\}\). In the first system the policy parameters are \((S,S_{c})\) and in the second system they are \((S,S_{c}^{\,\prime })\), \(S_{c}^{\, \prime }>S_{c}\). In the proof of Proposition 2 in Vicil and Jackson (2016), it is shown that \(R^{\, \prime }_{m}=R_{m}\), and \(B^{\, \prime }_{n,m}\ge B_{n,m}\) for all m. If we consider (2) and (3), then we have \(OH^{\, \prime }_{m}\ge OH_{m}\) and \(B^{\, \prime }_{c,m}\le B_{c,m}\) for all m . Since these are also true for all sample paths, they also hold for the expected values. Hence, the results \({\mathbf {B}}_{n}(S,S_{c}+1) \ge {\mathbf {B}}_{n}(S,S_{c})\), \({\mathbf {B}}_{c}(S,S_{c}+1) \le {\mathbf {B}}_{n}(S,S_{c})\) and \({\mathbf {I}} (S,S_{c}+1) \ge {\mathbf {I}} (S,S_{c})\) follow immediately. \(\square\)
Appendix: D Proof of Theorem 1
Invariance of the non-critical class fill rate in (17) is the direct result of (6). (18) is the result of Lemma 3.2 in Vicil and Jackson (2018).
\(\square\)
Appendix: E Proof of Lemma 4
Due to Proposition 2, \(\rho _{n}\lambda _{n}(1-\beta _{n}(S,S_{c}))\) is monotonically increasing in \(S_{c}\), and \({\mathbf {B}}_{n}(S,S_{c})\) and \({\mathbf {I}}(S,S_{c})\) are nondecreasing in \(S_{c}\). \(\square\)
Appendix: F Proof of Proposition 4
The following relations hold for any \((S,S_{c})\) pair:
(F.2) follows from (F.1) due to (1), which also holds for the expected values. (F.3) follows from (F.2) due to (11). Furthermore, for given S the relation \(C(S,S_{c})\ge h \left( S-\lambda T \right)\) holds for all \(S_{c}\) because RHS of (F.3) is independent of \(S_{c}\). Hence, \(C^{*}(S)\ge h \left( S-\lambda T \right)\) should hold by definition. \(\square\)
Rights and permissions
About this article
Cite this article
VICIL, O. Cost optimization in the \((S-1, S)\) backorder inventory model with two demand classes and rationing. Flex Serv Manuf J 34, 101–124 (2022). https://doi.org/10.1007/s10696-021-09418-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-021-09418-7