Korean J. Math. Vol. 29 No. 2 (2021) pp.371-386
DOI: https://doi.org/10.11568/kjm.2021.29.2.371

Comparison of discrete time inventory systems with positive service time and lead time

Main Article Content

Balagopal N.
Deepthi C. P.
Jayaprasad P. N.
Varghese Jacob


This paper investigates two discrete time queueing inventory models with positive service time and lead time. Customers arrive according to a Bernoulli process and service time and lead time follow geometric distributions. The first model under discussion based on replenishment of order upto $S$ policy where as the second model is based on order placement by a fixed quantity $Q$, where $Q=S-s$, whenever the inventory level falls to $s$. We analyse this queueing systems using the matrix geometric method and derive an explicit expression for the stability condition. We obtain the steady-state behaviour of these systems and several system performance measures. The influence of various parameters on the systems performance measures and comparison on the cost analysis are also discussed through numerical example.

Article Details


[1] Alfa A. S., Discrete Time Queues and Matrix Analytic Methods, Top. 10 (2) (2002),147–210. Google Scholar

[2] Google Scholar

[3] Bruneel H., Performance of discrete time queueing systems, Computers & Operations Research. 20 (1993), 303–320. Google Scholar

[4] Google Scholar

[5] Bruneel H, Kim B G., Discrete time model for communication systems including ATM. Kluwer Academic Publishers, Boston, 1993. Google Scholar

[6] Google Scholar

[7] Balagopal N, Deepthy C P, Jayaprasad P N, Jacob V., Discrete Time Queueing Inventory Models with Inventory Dependent Customer Arrival Under (s,S) Policy. Neural Parallel and Scientific Computations. 28 (1), (2020), 37–52. Google Scholar

[8] Google Scholar

[9] Deepthi C P., Discrete Time Inventory Models with/without postive service time. Ph. D thesis submitted to Cochin University of Science & Technology. Cochin, India, 2013. Google Scholar

[10] Google Scholar

[11] Hadley G, Whitin T M., Analysis of Inventory Systems. Prentice-Hall. Englewood Cliffs, New Jersey, 1963. Google Scholar

[12] Google Scholar

[13] Kalpakam S, Sapna K P., Continuous review (s, S) inventory system with stochastic lead times. Mathematical and Computational Modelling. 4 (1994), 915–1046. Google Scholar

[14] Google Scholar

[15] Krishnamoorthy A, Viswanath C N., Stochastic decomposition in production inventory with service time . Eur. J. Oper. Res. 228 (2) (2013), 358–366. Google Scholar

[16] Google Scholar

[17] Lian Z, Liu L., A Discrete time model for perishable inventory systems. Ann. Oper. Res. 87 (1999),103–116. Google Scholar

[18] Google Scholar

[19] Liu L, Yang T., An (s, S) random lifetime inventory model with positive lead time. Eur. J. Oper. Res. 113 (1999), 52–63. Google Scholar

[20] Google Scholar

[21] Meisling T., Discrete time queueing theory. Oper. Res. 6 (1958), 96–105. Google Scholar

[22] Google Scholar

[23] Naddor E., Inventory Systems . John Wiley and Sons, New York, 1966. Google Scholar

[24] Google Scholar

[25] Neuts M. F., Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach . 2nd ed. Dover Publications Inc., New York, 1994. Google Scholar

[26] Google Scholar

[27] Schwarz M, Sauer C, Daduna H. Kulik R, Szekli R., M/M/1 queueing system with inventory. Queueing Syst. 54 (1) (2006,) 55–78. Google Scholar

[28] Google Scholar

[29] Woodward M E., Communication and Computer Networks : Modelling with Discrete time queues. IEEE Computer Society Press. Los Alamitos, California, 1994. Google Scholar

[30] Google Scholar

[31] Yang T, Chaudhry M L., On Steady-state Queue size distributions of the Discrete time GI/G/1 queue, Adv. Appl. Prob. 28 (1996), 1177–1200. Google Scholar

[32] Google Scholar

[33] Yang T, Li., Geo/G/1 retrial queue with Bernoulli Schedule . Eur. J. Oper. Res. 111 (1998), 629–649. Google Scholar

[34] Google Scholar