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

Paul Manuel , B. Sivakumar , G. Arivarignan

Journal of Systems Science and Systems Engineering ›› 2007, Vol. 16 ›› Issue (1) : 62 -73.

PDF
Journal of Systems Science and Systems Engineering ›› 2007, Vol. 16 ›› Issue (1) : 62 -73. DOI: 10.1007/s11518-006-5025-3
Article

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

Author information +
History +
PDF

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.

Keywords

Stochastic inventory / Markovian demands / service facility / positive lead time / negative customers

Cite this article

Download citation ▾
Paul Manuel, B. Sivakumar, G. Arivarignan. A perishable inventory system with service facilities, MAP arrivals and PH — Service times. Journal of Systems Science and Systems Engineering, 2007, 16(1): 62-73 DOI:10.1007/s11518-006-5025-3

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

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

[2]

Arivarignan G., Sivakumar B.. Srinivasan S. K., Vijayakumar A.. Inventory system with renewal demands at service facilities. Stochastic Point Processes, 2003, New Delhi, India: Narosa Publishing House 108-123.

[3]

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

[4]

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

[5]

Berman O., Kim E.. Stochastic inventory policies for inventory management of service facilities. Stochastic Models, 1999, 15: 695-718.

[6]

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

[7]

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

[8]

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

[9]

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

[10]

Elango C.. A continuous review perishable inventory system at service facilities, 2001, Madurai: Madurai Kamaraj University

[11]

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

[12]

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

[13]

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

[14]

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

[15]

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

[16]

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

[17]

Kalpakam S., Arivarignan G.. Inventory system with random supply quantity. OR Spektrum, 1990, 12: 139-145.

[18]

Latouche G., Ramaswami V.. Introduction to matrix analytic methods in stochastic modelling, 1999, Philadelphia: SIAM

[19]

Lee G., Jeon J.. A New approach to an N/G/1 queue. Queueig Systems, 2000, 35: 317-322.

[20]

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

[21]

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

[22]

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

[23]

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

[24]

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. Advances in Applied Probability, 1990, 22: 676-705.

[25]

Nahmias S.. Perishable inventory theory: A review. Operations Research, 1982, 30: 680-708.

[26]

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

[27]

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

[28]

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

[29]

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

[30]

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

[31]

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

[32]

Ross S. M.. Introduction to Probability Models, 2000, Singapore: Harcourt Asia PTE Ltd.

[33]

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

[34]

Yadavalli V. S. S., Van CdeW S., Strashein J. J., Udayabakaran S.. A Single Product Perishing Inventory Model with Demand Interaction. Orion, 2004, 20: 109-124.

AI Summary AI Mindmap
PDF

129

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/