OPSEARCH

, Volume 55, Issue 1, pp 134–149 | Cite as

A stochastic inventory system with two modes of service and retrial of customers

Application Article
  • 64 Downloads

Abstract

This paper analyses an inventory model with positive service time and retrial of customers. The customers arrive according to a Markovian Arrival Process with representation (\(D_{0} ,D_{1}\)). The service times are assumed to be of Phase type distribution with representation \(\left( {\eta ,U} \right)\). When the inventory level depletes to the reorder point s, the service is given at a reduced rate and the service time distribution has the representation \(\left( {\eta ,\alpha U} \right)\), where \(0 < \alpha < 1\). An arriving customer, who finds the inventory level zero or the server busy, enters into an orbit of infinite capacity and will retry for service from there. The lead time follows an exponential distribution with rate β. We analyze the system using Matrix Analytic Method. Some important performance measures in the steady state are obtained. A suitable cost function for the expected total cost is constructed and analyzed numerically and graphically.

Keywords

Inventory Retrial Markovian arrival process Phase type distribution Matrix analytic method Cost analysis 

Notes

Acknowledgements

The authors are thankful to the editor and reviewers for their valuable comments and suggestions, which improved the quality of the paper.

References

  1. 1.
    Neuts, M. F.: Matrix-geometric solutions in stochastic models: an algorithmic approach. Johns Hopkins University Press, Baltimore (1981)Google Scholar
  2. 2.
    Artalejo, J.R., Krishnamoorthy, A., Lopez Herrero, M.J.: Numerical analysis of (s, S) inventory systems with repeated attempts. Ann. Oper. Res. 141, 67–83 (2006)CrossRefGoogle Scholar
  3. 3.
    Berman, O., Kaplan, E.H., Shimshak, D.G.: Deterministic approximations for inventory management at service facilities. IIE Trans. 25(5), 98–104 (1993)CrossRefGoogle Scholar
  4. 4.
    Berman, O., Spna, K.P.: Inventory management at service facilities for systems with arbitrary distributed service times. Commun. Stat. Stoch. Models 16(3–4), 343–360 (2000)CrossRefGoogle Scholar
  5. 5.
    Sigman, K., Simchi-Levi, D.: Light traffic heuristic for an M/G/1 queue with limited inventory. Ann. Oper. Res. 40(1), 371–380 (1992)CrossRefGoogle Scholar
  6. 6.
    Parthasarathy, P.R., Vijayalakshmi, V.: Transient analysis of an (S − 1, S) inventory model: a numerical approach. Int. J. Comput. Math. 59, 177–185 (1996)CrossRefGoogle Scholar
  7. 7.
    Krishnamoorthy, A., Deepak, T.G., Narayanan, V.C., Vineetha, K.: Effective utilization of idle time in an (s, S) inventory with positive service time. J. Appl. Math. Stoch. Anal. 2006, 69068 (2006)Google Scholar
  8. 8.
    Narayanan, V.C., Deepak, T.G., Krishnamoorthy, A., Krishnakumar, B.: On an (s, S) inventory policy with service time, vacation to server and correlated lead time. Qual. Technol. Quant. Manage. 5(2), 129–143 (2008)Google Scholar
  9. 9.
    Krishnamoorthy, A., Jose, K.P.: An (s, S) inventory system with positive lead time, loss and retrial of customers. Stoch. Model. Appl. 8(2), 56–71 (2005)Google Scholar
  10. 10.
    Krishnamoorthy, A., Dhanya, S., Lakshmy, B.: On a queueing-inventory with reservation, cancellation, common life time and retrial. Ann. Oper. Res. 247(1), 365–389 (2016)Google Scholar
  11. 11.
    Manuel, P., Sivakumar, B., Arivarignan, G.: A perishable inventory system with service facilities, MAP arrivals and PH-service times. J. Syst. Sci. Syst. Eng. 16(1), 62–73 (2007)Google Scholar
  12. 12.
    Kim, C.S., Mushko, V.V., Dudin, A.N.: Computation of the steady state distribution for multi-server retrial queues with phase type service process. Ann. Oper. Res. 201(1), 307–323 (2012)CrossRefGoogle Scholar
  13. 13.
    Neuts, M.F., Lucantoni, D.M.: A Markovian queue with N servers subject to breakdowns and repairs. Manag. Sci. 25(9), 849–861 (1979)CrossRefGoogle Scholar
  14. 14.
    Chakravarthy, S.R.: Analysis of MAP/PH/c retrial queue with phase type retrials-simulation approach. Mod. Probab. Methods Anal. Telecommun. Netw. 356, 37–49 (2013)CrossRefGoogle Scholar
  15. 15.
    Chakravarthy, S.R., Neuts, M.F.: Analysis of a multi-server queueing model with MAP arrivals of regular customers and phase type arrivals of special customers. Simul. Model. Pract. Theory 43, 79–95 (2014)CrossRefGoogle Scholar
  16. 16.
    Lucantoni, D.M., Meier-Hellstern, K.S., Neuts, M.F.: A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Probl. 22, 676–705 (1990)CrossRefGoogle Scholar
  17. 17.
    Gupta, U., Laxmi, P.V.: Analysis of the MAP/Ga,b/1/N queue. Queueing Syst. 38(2), 109–124 (2001)CrossRefGoogle Scholar
  18. 18.
    He, Q.-M., Alfa, A.S.: Construction of Markov chains for discrete time MAP/PH/K queues. Perform. Eval. 93, 17–26 (2015)CrossRefGoogle Scholar
  19. 19.
    Neuts, M.F., Rao, B.M.: Numerical investigation of a multi-server retrial model. Queueing Syst. 7(2), 169–189 (1990)CrossRefGoogle Scholar
  20. 20.
    Falin, G.I.: A survey of retrial queues. Queueing Syst. 7(2), 127–167 (1990)CrossRefGoogle Scholar
  21. 21.
    Tweedie, R.L.: Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. Math. Proc. Camb. Philos. Soc. 78, 125–136 (1975)CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2017

Authors and Affiliations

  1. 1.Department of Basic Science and HumanitiesAdi Shankara Institute of Engineering & TechnologyKaladyIndia
  2. 2.PG and Research Department of MathematicsSt. Peter’s CollegeKolencheryIndia

Personalised recommendations