Skip to main content
SpringerLink
Log in

A perishable inventory system with service facilities, MAP arrivals and PH — Service times

  • Published:
Journal of Systems Science and Systems Engineering Aims and scope Submit manuscript

Abstract

We consider a continuous review perishable (s, S) inventory system with a service facility consisting of a waiting hall of finite capacity and a single server. We assume two types of customers, ordinary and negative, arrive according to a Markovian Arrival Process (MAP). An ordinary customer joins the queue and a negative customer instead of joining the queue removes one ordinary customer from the queue. The removal rule adopted in this paper is RCE (removal of a customer from the end). The individual customer’s unit demand is satisfied after a random time of service which is assumed to have a phase-type distribution. The life time of each item and the lead time of the reorders have been assumed to be independent exponential distributions. The joint probability distribution of the number of customers in the system and the inventory level is obtained for the steady state case. Various stationary system performance measures are computed and the total expected cost rate is calculated. The results are illustrated numerically.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arivarignan, G., Elango, C. & Arumugam, N. (2002). A continuous review perishable inventory control system at service facilities. In: Artalejo J. R., Krishnamoorthy A (eds.), Advances in Stochastic Modelling, pp. 19–40. Notable Publications, Inc., New Jersey, USA

    Google Scholar 

  2. Arivarignan, G. & Sivakumar, B. (2003). Inventory system with renewal demands at service facilities. In: Srinivasan S. K. and Vijayakumar A. (eds.), Stochastic Point Processes, pp.108–123, Narosa Publishing House, New Delhi, India

    Google Scholar 

  3. Artalejo, J. R. (2000). G-networks: A versatile approach for work removal in queueing networks. European Journal of Operational Research, 126:233–249

    Article  MATH  MathSciNet  Google Scholar 

  4. Berman, O., Kaplan, E. H. & Shimshak, D. G. (1993). Deterministic approximations for inventory management at service facilities. IIE Transactions, 25:98–104

    Google Scholar 

  5. Berman, O. & Kim, E. (1999). Stochastic inventory policies for inventory management of service facilities. Stochastic Models, 15:695–718

    MATH  MathSciNet  Google Scholar 

  6. Berman, O. & Sapna, K. P. (2000). Inventory management at service facilities for systems with arbitrarily distributed service times. Stochastic Models, 16:343–360

    MATH  MathSciNet  Google Scholar 

  7. Chakravarthy, S. (1999). The batch markovian arrival process: a review and future work. In: A. Krishnamoorthy et al., (eds.), Advances in Probability and Stochastic Processes, pp.21–49, Notable publication, Inc., New Jersey, USA

    Google Scholar 

  8. Chakravarthy, S. & Dudin, A. (2003). Analysis of a retrial queueing model with map arrivals and two types of customers. Mathematical and Computer Modelling, 37: 343–363

    Article  MATH  MathSciNet  Google Scholar 

  9. Chao, X., Miyazawa, M. & Pinedo, M. (1999). Queueing Networks: Customers, Signal and Product form Solutions. Wiley, Chichester.

    Google Scholar 

  10. Elango, C. (2001). A continuous review perishable inventory system at service facilities. Ph. D., Thesis, Madurai Kamaraj University, Madurai

    Google Scholar 

  11. Gelenbe, E. (1991). Production — form queueing networks with negative and positive customers. Journal of Applied Probability, 30: 742–748

    Article  MathSciNet  Google Scholar 

  12. Gelenbe, E. & Pujolle, G. (1998). Introduction to Queueing Networks. Second Edition, Wiley Chichester

  13. He, Q-M. (1996). Queues with marked customers. Advances in Applied Probability, 28: 567–587

    Article  MATH  MathSciNet  Google Scholar 

  14. He, Q-M. (2001). The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue. Queueing Systems, 38: 397–418

    Article  MATH  MathSciNet  Google Scholar 

  15. He, Q-M., Jewkes, E. M. & Buzacott, J. (1998). An efficient algorithm for computing the optimal replenishment policy for an inventory-production system. In: Alfa A. Chakravarthy S. (eds.), Advances in Matrix Analytic Methods for Stochastic Models, pp.381–402, Notable Publications, New Jersey, USA

    Google Scholar 

  16. He, Q-M. & Neuts, M. F. (1998). Markov chains with marked transitions. Stochastic Processes and Their Applications, 74: 37–52

    Article  MATH  MathSciNet  Google Scholar 

  17. Kalpakam, S. & Arivarignan, G. (1990). Inventory system with random supply quantity. OR Spektrum, 12: 139–145

    Article  MATH  MathSciNet  Google Scholar 

  18. Latouche, G. & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modelling. SIAM, Philadelphia

    Google Scholar 

  19. Lee, G. & Jeon, J. (2000). A New approach to an N/G/1 queue. Queueig Systems, 35: 317–322

    Article  MATH  MathSciNet  Google Scholar 

  20. Li, Q.L. & Li, J. J. (1994). An Application of Markov-modulated poisson process to two-unit series repairable system. Journal of Engereeing Mathematics, 11: 56–66

    MATH  Google Scholar 

  21. Liu, L. & Yang, T. (1999). An (s, S) random lifetime inventory model with a positive lead time. European Journal of Operational Research, 113: 52–63

    Article  MATH  Google Scholar 

  22. Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Stochastic Models, 7: 1–46

    MATH  MathSciNet  Google Scholar 

  23. Lucantoni, D. M. (1993). The BMAP/G/1 queue: a tutorial, models and techniques for performance evaluation of computer and communications systems. L. Donatiello and R. Nelson (ED.), Springer-Verlag, New York, pp.330–358

    Google Scholar 

  24. Lucantoni, D.M., Meier-Hellstern, K.S. & Neuts, M.F. (1990). A single server queue with server vacations and a class of non-renewal arrival processes. Advances in Applied Probability, 22: 676–705

    Article  MATH  MathSciNet  Google Scholar 

  25. Nahmias, S. (1982). Perishable inventory theory: A review. Operations Research, 30: 680–708

    Article  MATH  Google Scholar 

  26. Neuts, M. F. (1994). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover Publication Inc. New York.

    Google Scholar 

  27. Neuts, M. F. (1989). Structured Stochastic Matrices in M/G/1 Type and Their Applications. Marcel Dekker

  28. Neuts, M. F. (1995). Matrix-analytic methods on the theory of queues. In: Dshalalow J.H. (ed.), Advances in Queueing: Theory, Methods and Open Problems, pp.265–292, CRC, New York

    Google Scholar 

  29. Perumal, V. & Arivarignan, G. (2002). A continuous review perishable inventory system at infinite capacity service facilities. ANJAC Journal of Science, 1: 37–45

    Google Scholar 

  30. Raafat, F. (1991). A survey of literature on continuously deteriorating inventory models. Journal of Operational Research Society, 42: 27–37

    Article  MATH  Google Scholar 

  31. Ramaswami, V. (1981). The N/G/1 queue and its detailed analysis. Advances in Applied Probability, 12: 222–261

    Article  MathSciNet  Google Scholar 

  32. Ross, S. M. (2000). Introduction to Probability Models. Harcourt Asia PTE Ltd, Singapore

    MATH  Google Scholar 

  33. Shin, Y.W. & Choi, B.D. (2003). A queue with positive and negative arrivals governed by a Markov chain. Probability in the Engineering and Informational Sciences, 17: 487–501

    Article  MATH  MathSciNet  Google Scholar 

  34. Yadavalli V. S. S., CdeW Van Schoor, Strashein, J. J. & Udayabakaran, S. (2004). A Single Product Perishing Inventory Model with Demand Interaction. Orion, 20: 109–124

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Kuwait University, Kuwait

    Paul Manuel

  2. Department of Applied Mathematics and Statistics, School of Mathematics, Madurai Kamaraj University, Madurai, Tamilnadu, India

    B. Sivakumar & G. Arivarignan

Authors
  1. Paul Manuel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Arivarignan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Arivarignan.

Additional information

This work was supported in part by National Board for Higher Mathematics, INDIA under Grant No. 48/3/2004/R&D-II/2114.

Paul Manuel graduated PhD (1981–1986, Applied Mathematics) from Indian Institute of Technology India, MS (1991–1992, Computer Science) from University of Saskatchewan, Canada, and PhD (1992–1996, Computer Science) from University of Newcastle, Australia. He is an Associate Professor in Information Science, Kuwait University, Kuwait. While in the industries, he was working in various projects related to supply chain management. He is an ABET consultant to several institutions. His research interests are Knowledge Management and Algorithmic Graph Theory. He has published several papers in various journals of mathematics and computer science.

B. Sivakumar is carrying out his Ph.D. programme in the study of Inventory Systems with Service Facilities in the Department of Applied Mathematics and Statistics, Madurai Kamaraj University, Madurai. In 2002 he received his M.Sc (Mathematics) from School of Mathematics, Madurai Kamaraj University, INDIA. His areas of research interest are Inventory Management and Queueing theory.

G. Arivarignan received M.Sc(Statistics) from Annamalai University and his Ph.D. from Indian Institute of Technology, Madras. Since 1974, he worked as Assistant Professor of Statistics in Tamilnadu Collegiate Educational service and has joined Madurai Kamaraj University in 1990. His research interests are Stochastic Modelling and Applied Statistics. He has numerous publications in various journals of Statistics, Mathematics and Operations Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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, 62–73 (2007). https://doi.org/10.1007/s11518-006-5025-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11518-006-5025-3

Keywords

Search

Navigation