Skip to main content

Critical level rationing in inventory systems with continuously distributed demand

Abstract

This paper analyzes the use of a constant critical level policy for fast-moving items, where rationing is used to provide differentiated service levels to two demand classes (high priority and low priority). The previous work on critical level models, with either a continuous or periodic review policy, has only considered slow-moving items with Poisson demand. In this work, we consider a continuous review (QrC) policy with two demand classes that are modeled through continuous distributions, and the service levels are measured by the probability of satisfying the entire demand of each class during the lead time. We formulate a service level problem as an non-linear problem with chance constraints for which we optimally solve a relaxation obtaining a closed-form solution that can be computed easily. For instances, we tested, computational results show that our solution approach provides good-quality solutions that are on average \(0.3~\%\) from the optimal solution.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2

References

  • Applebaum D (2009) Lévy processes and stochastic calculus. Cambridge University Press, Cambridge

  • Arslan H, Graves SC, Roemer T (2007) A single-product inventory model for multiple demand classes. Manag Sci 53:1486–1500

    Article  Google Scholar 

  • Axsäter S (2006) Inventory control. Springer’s, USA

    Google Scholar 

  • Bulut Ö, Fadiloğlu MM (2011) Production control and stock rationing for a make-to-stock system with parallel production channels. IIE Trans 43(6):432–450

    Article  Google Scholar 

  • De Vericourt F, Karaesmen F, Dallery Y (2000) Dynamic scheduling in a make-to-stock system: a partial characterization of optimal policies. Oper Res 48(5):811–819

    Article  Google Scholar 

  • De Vericourt F, Karaesmen F, Dallery Y (2002) Optimal stock allocation for a capacitated supply system. Manag Sci 48(11):1486–1501

    Article  Google Scholar 

  • Dekker R, Kleijn MJ, De Rooij P (1998) A spare parts stocking policy based on equipment criticality. Int J Prod Econ 56:69–77

    Article  Google Scholar 

  • Dekker R, Hill RM, Kleijn MJ, Teunter RH (2002) On the (s-1, s) lost sales inventory model with priority demand classes. Nav Res Logist 49:593–610

    Article  Google Scholar 

  • Deshpande V, Cohen MA, Donohue K (2003) A threshold inventory rationing policy for service-differentiated demand classes. Manag Sci 49:683–703

    Article  Google Scholar 

  • Eppen G (1979) Effect of centralization on expected cost in a multi-location newsboy problem. Manag Sci 25:498–501

    Article  Google Scholar 

  • Fadiloglu M, Bulut O (2010) A dynamic rationing for continuous-review inventory systems. Eur J Oper Res 202:675–685

    Article  Google Scholar 

  • Fadıloğlu MM, Bulut Ö (2010) An embedded markov chain approach to stock rationing. Oper Res Lett 38(6):510–515

    Article  Google Scholar 

  • Ha AY (1997a) Inventory rationing in a make-to-stock production system with several demand classes and lost sales. Manag Sci 43(8):1093–1103

    Article  Google Scholar 

  • Ha AY (1997b) Stock-rationing policy for a make-to-stock production system with two priority classes and backordering. Nav Res Logist (NRL) 44(5):457–472

    Article  Google Scholar 

  • Ha AY (2000) Stock rationing in an m/ek/1 make-to-stock queue. Manag Sci 46(1):77–87

    Article  Google Scholar 

  • Isotupa KS (2006) An (s, q) markovian inventory system with lost sales and two demand classes. Math Comput Model 43:687–694

    Article  Google Scholar 

  • Kleijn M, Dekker R (1999) An overview of inventory systems with several demand classes, Lecture notes in economics and mathematical systems. Springer, Berlin, Heidelberg

    Google Scholar 

  • Meerschaert MM, Scheffler HP (2008) Triangular array limits for continuous time random walks. Stoch Process Appl 118(9):1606–1633

    Article  Google Scholar 

  • Melchiors P, Dekker R, Kleijn M (2000) Inventory rationing in an (s, q) inventory model with lost sales and two demand classes. J Oper Res Soc 51:111–122

    Article  Google Scholar 

  • Möllering KT, Thonemann UW (2010) An optimal constant level rationing policy under service level constraints. OR Spectr 32:319–341

    Article  Google Scholar 

  • Nahmias S, Demmy WS (1981) Operating characteristics of an inventory system with rationing. Manag Sci 27:1236–1245

    Article  Google Scholar 

  • Park C, Padgett WJ (2005) Accelerated degradation models for failure based on geometric brownian motion and gamma processes. Lifetime Data Anal 11:511–527

    Article  Google Scholar 

  • Peterson R, Silver EA (1979) Decision systems for inventory management and production planning. Wiley, New York

  • Piplani R, Liu S (2014) Comparison of capacity rationing policies for a make-to-order production system with two customer classes. Int J Ind Syst Eng 16(2):223–237

    Google Scholar 

  • Ramaekers K, Janssens GK (2008) On the choice of a demand distribution for inventory management models. Eur J Ind Eng 2(4):479–491

    Article  Google Scholar 

  • Serfozo R, Stidham S (1978) Semi-stationary clearing processes. Stoch Process Appl 6(2):165–178

    Article  Google Scholar 

  • Teunter RH, Haneveld WKK (2008) Dynamic inventory rationing strategies for inventory systems with two demand classes, poisson demand and backordering. Eur J Oper Res 190:156–178

    Article  Google Scholar 

  • Wang D, Tang O, Huo J (2013a) A heuristic for rationing inventory in two demand classes with backlog costs and a service constraint. Comput Oper Res 40(12):2826–2835

  • Wang Y, Zhang S, Sun L (2013b) Anticipated rationing policy for two demand classes under service level constraints. Comput Ind Eng 23:1200–1212

    Google Scholar 

  • Zheng YS (1992) On properties of stochastic inventory systems. Manag Sci 38(1):87–103

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. Escalona.

Appendices

Appendix 1: Proof of proposition 2

Lemma 1

Let X and Y be two univariate continuous random variables, where Y has positive support. Then, for any C, we have

$$\begin{aligned} \mathbb {P}(X + Y> C )\ge \mathbb {P}(X > C). \end{aligned}$$

Proof

We note that the set of realizations \(\{\omega ~|~ X(\omega )> C\}\subset \{\omega ~|~ X(\omega )+Y(\omega ) > C\} \), which gives the inequality \(\mathbb {P}(X+Y> C) \ge \mathbb {P}(X> C)\). \(\square \)

Given Lemma 1, the demonstration of Proposition 2 is:

Proof

Let \(\tau _{R,D}^{r-C}=\min \{\tau _{H,D}^{r-C},L\}\) be the time to rationing, which corresponds to the amount of time that elapses from the moment an order is placed until the critical level C is reached if this event occurs during the lead time. If the hitting time \(\tau _{H,D}^{r-C}\) does not occur during lead time, then the time to rationing is defined as \(\tau _{R,D}^{r-C}=L\). In this case, rationing coincides with the reception of the replenishment batch, and therefore, to be precise, rationing is not produced.

Given a \(k>0\) we have that, for every demand realization \(\omega \), the hitting time satisfies \(\tau _{H,D}^{r-C}(\omega ) < \tau _{H,D}^{r+k-C}(\omega )\). This is because exactly k additional units of demand are necessary to reach C, and the demand is a strictly increasing non-negative demand. This implies that for any \(k>0\) we have that

$$\begin{aligned} \tau _{R,D}^{r-C}(\omega )< \tau _{R,D}^{r+k-C}(\omega )&\forall \omega \mathrm{~s.t.~} \tau _{H,D}^{r-C}(\omega ) < L, \\ L = \tau _{R,D}^{r-C}(\omega ) = \tau _{R,D}^{r+k-C}(\omega )&\forall \omega \mathrm{~s.t.~} \tau _{H,D}^{r-C}(\omega ) \ge L \ . \end{aligned}$$

From these relations, we have that \(\tau _{R,D}^{r+k-C}-\tau _{R,D}^{r-C}\ge 0\) with probability 1, which combined with the assumptions on the demand gives us \(D_1(L-\tau _{R,D}^{r-C}) = D_1(L-\tau _{R,D}^{r+k-C})+ D_1(\tau _{R,D}^{r+k-C}-\tau _{R,D}^{r-C})\), where the last term is a positive support random variable when \(\tau _{H,D}^{r-C} < L\). We, therefore, have

$$\begin{aligned} \alpha _1(r,C)= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ~|~ \tau _{H,D}^{r-C} \ge L)\mathbb {P}( \tau _{H,D}^{r-C} \ge L) \\&+\, \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ~|~ \tau _{H,D}^{r-C}< L)\mathbb {P}( \tau _{H,D}^{r-C}< L) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r+k-C}) \le C ~|~ \tau _{H,D}^{r-C} \ge L)\mathbb {P}( \tau _{H,D}^{r-C} \ge L) \\&+\, \mathbb {P}(D_1(L-\tau _{R,D}^{r+k-C})\\&+\, D_1(\tau _{R,D}^{r+k-C}-\tau _{R,D}^{r-C}) \le C ~|~ \tau _{H,D}^{r-C}< L)\mathbb {P}( \tau _{H,D}^{r-C}< L) \\\le & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r+k-C}) \le C ~|~ \tau _{H,D}^{r-C} \ge L)\mathbb {P}( \tau _{H,D}^{r-C} \ge L) \\&+\, \mathbb {P}(D_1(L-\tau _{R,D}^{r+k-C})\le C ~|~ \tau _{H,D}^{r-C}< L)\mathbb {P}( \tau _{H,D}^{r-C} < L) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r+k-C}) \le C ) = \alpha _1(r+k,C). \end{aligned}$$

Here, the inequality uses Lemma 1 with \(X= D_1(L-\tau _{R,D}^{r+k-C})\) and \(Y=D_1(\tau _{R,D}^{r+k-C}-\tau _{R,D}^{r-C})\).

We repeat the argument to show the tendency of \(\alpha _1(r,C)\) with respect to C. Given any \(k>0\), we have that \(\tau _{H,D}^{r-(C+k)}(\omega ) < \tau _{H,D}^{r-C}(\omega )\) for any demand realization \(\omega \). Similarly, for any \(k>0\), we now have

$$\begin{aligned} \tau _{R,D}^{r-(C+k)}(\omega )< \tau _{R,D}^{r-C}(\omega )&\forall \omega \mathrm{~s.t.~} \tau _{H,D}^{r-(C+k)}(\omega ) < L \\ L = \tau _{R,D}^{r-(C+k)}(\omega ) = \tau _{R,D}^{r-C}(\omega )&\forall \omega \mathrm{~s.t.~} \tau _{H,D}^{r-(C+k)}(\omega ) \ge L \ . \end{aligned}$$

The demand can be now separated \(D_1(L-\tau _{R,D}^{r-(C+k)}) = D_1(L-\tau _{R,D}^{r-C})+D_1(\tau _{R,D}^{r-C}-\tau _{R,D}^{r-(C+k)})\), where for every demand realization \(\omega \), this last term satisfies \(D_1(\tau _{R,D}^{r-C}-\tau _{R,D}^{r-(C+k)})(\omega ) \le k\). This because \(\tau _{R,D}^{r-C}(\omega )-\tau _{R,D}^{r-(C+k)}(\omega ) \le \tau _{H,D}^{r-C}(\omega )-\tau _{H,D}^{r-(C+k)}(\omega )\) and \(D_1(\tau _{H,D}^{r-C}-\tau _{H,D}^{r-(C+k)})\le D(\tau _{H,D}^{r-C}-\tau _{H,D}^{r-(C+k)})=k\) by definition of hitting time. This gives

$$\begin{aligned} \alpha _1(r,C)= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ~|~ \tau _{H,D}^{r-(C+k)} \ge L)\mathbb {P}( \tau _{H,D}^{r-(C+k)} \ge L) \\&~~+ \ \mathbb {P}(D_1(L-\tau _{R,D}^{r-C}) \le C ~|~ \tau _{H,D}^{r-(C+k)}< L)\mathbb {P}( \tau _{H,D}^{r-(C+k)}< L) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-(C+k)}) \le C+k ~|~ \tau _{H,D}^{r-(C+k)} \ge L)\mathbb {P}( \tau _{H,D}^{r-(C+k)} \ge L) \\&~~+\ \mathbb {P}(D_1(L-\tau _{R,D}^{r-(C+k)})\\\le & {} C + D_1(\tau _{R,D}^{r-C}-\tau _{R,D}^{r-(C+k)}) ~|~ \tau _{H,D}^{r-(C+k)}< L)\mathbb {P}(\tau _{H,D}^{r-(C+k)}< L) \\\le & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-(C+k)}) \\\le & {} C+k ~|~ \tau _{H,D}^{r-(C+k)} \ge L)\mathbb {P}(\tau _{H,D}^{r-(C+k)} \ge L) \\&~~+\ \mathbb {P}(D_1(L-\tau _{R,D}^{r-(C+k)})\le C+k ~|~ \tau _{H,D}^{r-(C+k)}< L)\mathbb {P}(\tau _{H,D}^{r-(C+k)} < L) \\= & {} \mathbb {P}(D_1(L-\tau _{R,D}^{r-(C+k)}) \le C ) = \alpha _1(r,C+k) \ . \end{aligned}$$

Here, we add a k in the first term of the second equality, because \(D_1(L-\tau _{R,D}^{r-(C+k)}) = D_1(0)\) when \(\tau _{H,D}^{r-(C+k)} \ge L\), so that the first probability equals 1. The inequality comes from the fact that \(\mathbb {P}(D_1(\tau _{R,D}^{r-C}-\tau _{R,D}^{r-(C+k)})\le k) = 1\). \(\square \)

Appendix 2: Partial derivative of \(\alpha _1(r,C)\) with respect to C

Here, we give the expression of \(\frac{\partial {\alpha _1(r,C)}}{\partial {C}}\) in the case when the demands for both classes are normally distributed and the density function of the hitting time \(\tau _{H,D}^{r-C}\) is given by Eq. (19). We denote by \(\bar{\varphi }_{\mu ,\sigma ^2}(x)\) the density function of a normal random variable with mean \(\mu \) and variance \(\sigma ^2\). The partial derivative then can be expressed as

$$\begin{aligned}&\frac{\partial {\alpha _1(r,C)}}{\partial {C}} \nonumber \\&= \int _0^L \left( \frac{r-C+\mu \tau }{2\tau } - \frac{C+\mu _1(L-\tau )}{2(L-\tau )}\right) \bar{\varphi }_{\mu _1(L-\tau ),\sigma _1^2(L-\tau )}(C) \bar{\varphi }_{\mu \tau ,\sigma ^2\tau }(r-C)\mathrm{d}\tau .\nonumber \\ \end{aligned}$$
(32)

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Escalona, P., Ordóñez, F. & Kauak, I. Critical level rationing in inventory systems with continuously distributed demand. OR Spectrum 39, 273–301 (2017). https://doi.org/10.1007/s00291-016-0452-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-016-0452-0

Keywords

  • Inventory system
  • Critical level rationing
  • Fast-moving items
  • Service level
  • Continuous distributed demand
  • Two demand classes