Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지
DOI QR코드

DOI QR Code

COMPARISON OF DISCRETE TIME INVENTORY SYSTEMS WITH POSITIVE SERVICE TIME AND LEAD TIME

  • Balagopal, N (Department of Computer Science and Engineering, N.S.S. College of Engineering) ;
  • Deepthy, CP (Department of Mathematics, S. D. College) ;
  • Jayaprasad, PN (Department of Mathematics, Government College Kottayam) ;
  • Varghese, Jacob (Department of Mathematics, Government College Kottayam)
  • Received : 2021.04.09
  • Accepted : 2021.04.30
  • Published : 2021.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

Acknowledgement

The Authors thank the anonymous reviewers for the valuable suggestions and insightful comments which resulted in improvement in the presentation of the paper.

References

  1. Alfa A. S., Discrete Time Queues and Matrix Analytic Methods, Top. 10 (2) (2002),147-210. https://doi.org/10.1007/BF02579008
  2. Bruneel H., Performance of discrete time queueing systems, Computers & Operations Research. 20 (1993), 303-320. https://doi.org/10.1016/0305-0548(93)90006-5
  3. Bruneel H, Kim B G., Discrete time model for communication systems including ATM. Kluwer Academic Publishers, Boston, 1993.
  4. 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.
  5. 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.
  6. Hadley G, Whitin T M., Analysis of Inventory Systems. Prentice-Hall. Englewood Cliffs, New Jersey, 1963.
  7. Kalpakam S, Sapna K P., Continuous review (s, S) inventory system with stochastic lead times. Mathematical and Computational Modelling. 4 (1994), 915-1046.
  8. Krishnamoorthy A, Viswanath C N., Stochastic decomposition in production inventory with service time . Eur. J. Oper. Res. 228 (2) (2013), 358-366. https://doi.org/10.1016/j.ejor.2013.01.041
  9. Lian Z, Liu L., A Discrete time model for perishable inventory systems. Ann. Oper. Res. 87 (1999),103-116. https://doi.org/10.1023/A:1018960314433
  10. Liu L, Yang T., An (s, S) random lifetime inventory model with positive lead time. Eur. J. Oper. Res. 113 (1999), 52-63. https://doi.org/10.1016/S0377-2217(97)00426-8
  11. Meisling T., Discrete time queueing theory. Oper. Res. 6 (1958), 96-105. https://doi.org/10.1287/opre.6.1.96
  12. Naddor E., Inventory Systems . John Wiley and Sons, New York, 1966.
  13. Neuts M. F., Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach . 2nd ed. Dover Publications Inc., New York, 1994.
  14. Schwarz M, Sauer C, Daduna H. Kulik R, Szekli R., M/M/1 queueing system with inventory. Queueing Syst. 54 (1) (2006,) 55-78. https://doi.org/10.1007/s11134-006-8710-5
  15. Woodward M E., Communication and Computer Networks : Modelling with Discrete time queues. IEEE Computer Society Press. Los Alamitos, California, 1994.
  16. 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. https://doi.org/10.2307/1428169
  17. Yang T, Li., Geo/G/1 retrial queue with Bernoulli Schedule . Eur. J. Oper. Res. 111 (1998), 629-649. https://doi.org/10.1016/S0377-2217(97)90357-X