Numerical analysis of(s, S) inventory systems with repeated attempts
- 157 Downloads
This paper deals with a continuous review (s,S) inventory system where arriving demands finding the system out of stock, leave the service area and repeat their request after some random time. This assumption introduces a natural alternative to classical approaches based either on lost demand models or on backlogged models. The stochastic model formulation is based on a bidimensional Markov process which is numerically solved to investigate the essential operating characteristics of the system. An optimal design problem is also considered.
KeywordsInventory models Numerical methods of truncation Repeated attempts Stationary distribution
Unable to display preview. Download preview PDF.
- Anisimov, V.V. and J.R. Artalejo. (2002). “Approximation of Multiserver Retrial Queues by Means of Generalized Truncated Models.” Top 10, 51–66.Google Scholar
- Arrow, K.J., T.E. Harris, and J. Marschak. (1951). “Optimal Inventory Theory.” Econometrica 19, 250–272.Google Scholar
- Artalejo, J.R. and G.I. Falin. (2002). “Standard and Retrial Queueing Systems: A Comparative Analysis.” Revista Matematica Complutense 15, 101–129.Google Scholar
- Falin, G.I. and J.G.C. Templeton. (1997). Retrial Queues. Chapman and Hall, London.Google Scholar
- Shin, Y.W. and Y.C. Kim, (2000). “Stochastic Comparisons of Markovian Retrial Queues.” Journal of the Korean Statistical Society 29, 473–488.Google Scholar
- Srinivasan, S.K. (1979). “General Analysis of s-S Inventory Systems with Random Lead Times and Unit Demands.” Journal of Mathematical and Physical Sciences 13, 107–129.Google Scholar
- Takáçs, L. (1962). Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
- Tijms, H.C. (1994). Stochastic Models: An Algorithmic Approach. Wiley, Chichester.Google Scholar