zbMATH — the first resource for mathematics

A perishable inventory system with service facility and finite source. (English) Zbl 1426.90026
Summary: In this article, we consider a continuous review (\(s, S\)) perishable inventory system with a service facility, wherein the demand of a customer is satisfied only after performing some service on the item which is assumed to be of random duration. We also assume that the demands are generated by a finite homogeneous population. The service time, the lead time are assumed to have Phase type distribution. The life time of the item is assumed to have exponential distributions. The joint distribution of the number of customers in the system and the inventory level is obtained in the steady state case. The Laplace-Stieltjes transform of the waiting time of the tagged customer is derived. Various system performance measures are derived and the total expected cost rate is computed under a suitable cost structure. The results are illustrated numerically.

90B05 Inventory, storage, reservoirs
90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI
[1] Berman, O.; Kaplan, E. H.; Shimshak, D. G., Deterministic approximations for inventory management at service facilities, IIE Trans., 25, 98-104, (1993)
[2] Berman, O.; Kim, E., Stochastic inventory policies for inventory management of service facilities, Stoch. Model., 15, 695-718, (1999) · Zbl 0934.90002
[3] He, Q.-M.; Jewkes, E. M.; Buzacott, J., An efficient algorithm for computing the optimal replenishment policy for an inventory-production system, (Alfa, A.; Chakravarthy, S., Advances in Matrix Analytic Methods for Stochastic Models, (1998), Notable Publications New Jersey, USA), 381-402
[4] Berman, O.; Sapna, K. P., Inventory management at service facilities for systems with arbitrarily distributed service times, Stoch. Model., 16, 343-360, (2000) · Zbl 0959.90001
[5] Schwarz, M.; Sauer, C.; Daduna, H.; Kulik, R.; Szekli, R., M/M/1 queueing systems with inventory, Queueing Syst., 54, 55-78, (2006) · Zbl 1137.90429
[6] Yadavalli, V. S.S.; Sivakumar, B.; Arivarignan, G., Inventory system with renewal demands at service facilities, Int. J. Prod. Econ., 114, 252-264, (2008)
[7] Sivakumar, B.; Arivariganan, G., A perishable inventory system at service facilities with negative customers, Int. J. Info. Manage. Sci., 17, 2, 1-18, (2006) · Zbl 1190.90022
[8] Manuel, Paul; 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)
[9] Manuel, Paul; Sivakumar, B.; Arivarignan, G., A perishable inventory system with service facilities and retrial demands, Comput. Ind. Eng., 54, 484-501, (2007) · Zbl 1211.90023
[10] Weiss, H. J., Optimal ordering policies for continuous review perishable inventory models, Oper. Res., 28, 365-374, (1980) · Zbl 0426.90026
[11] Kalpakam, S.; Arivarignan, G., A continuous review perishable inventory model, Statistics, 19, 389-398, (1988) · Zbl 0652.90030
[12] Schmidt, C. P.; Nahmias, S., \((S - 1, S)\) policies for perishable inventory, Manage. Sci., 31, 719-728, (1985) · Zbl 0615.90035
[13] Kalpakam, S.; Sapna, K. P., Continuous review \((s, S)\) inventory system with random life times and positive lead times, Oper. Res. Lett., 16, 115-119, (1994) · Zbl 0819.90028
[14] Arivarignan, G., Perishable inventory system with renewal demands and \((- r, S)\) ordering policy, (Thangaraj, V., Stochastic Processes and Their Applications, (1994)), 211-220
[15] Liu, Liming; Yang, Tao, An \((s, S)\) random lifetime inventory model with a positive lead time, Eur. J. Oper. Res., 113, 52-63, (1999) · Zbl 0948.90006
[16] Nahmias, S., Perishable inventory theory: a review, Oper. Res., 30, 4, 680-708, (1982) · Zbl 0486.90033
[17] Raafat, F., Survey of literature on continuously deteriorating inventory models, J. Oper. Res. Soc., 42, 27-37, (1991) · Zbl 0718.90025
[18] Goyal, S. K.; Giri, B. C., Recent trends in modelling of deteriorating inventory, Eur. J. Oper. Res., 134, 1-16, (2001) · Zbl 0978.90004
[19] Nahmias, S., Perishable Inventory Systems, International Series in Operations Research and Management, 160, (2011), Springer
[20] Bakker, M.; Riezebos, J.; Teunter, R. H., Review of inventory systems with deterioration Since 2001, Eur. J. Oper. Res., 221, 275-284, (2012) · Zbl 1253.90017
[21] Takagi, H., Queueing Analysis. A Foundation of Performance Evaluation, Finite Systems, vol. 2, (1993), Amsterdam North-Holland
[22] Falin, G. F.; Artalejo, J. R., A finite source retrial queue, Eur. J. Oper. Res., 108, 409-424, (1998) · Zbl 0943.90012
[23] Artalejo, J. R., Retrial queues with a finite number of sources, J. Korean Math. Soc., 35, 3, 503-526, (1998) · Zbl 0930.60079
[24] Alfa, A. S.; Sapna Isotupa, K. P., An M/PH/k retrial queue with finite number of sources, Comput. Oper. Res., 31, 9, 1455-1464, (2004) · Zbl 1107.90008
[25] Sztrik, J., Finite-source queueing systems and their applications, (Ferenczi, M.; Pataricza, A.; Rnyai, L., Formal Methods in Computing, (2005), Akadémia Kiadó Budapest, Hungary), 311-356
[26] Artalejo, J. R.; López-Herrero, M. J., A simulation study of a discrete-time multiserver retrial queue with finite population, J. Stat. Plan. Infer., 137, 2536-2542, (2007) · Zbl 1119.60074
[27] Wiichner, P.; Sztrik, J.; De Meer, H., Finite-source \(M / M / S\) retrial queue with search for balking and impatient customers from the orbit, Comput. Netw., 53, 8, 1264-1273, (2009) · Zbl 1178.68109
[28] Jinbiao, Wu.; Liu, Z.; Yang, G., Analysis of the finite source \(\mathit{MAP} / \mathit{PH} / N\) retrial G-queue operating in a random environment, Appl. Math. Model., 35, 3, 1184-1193, (2011) · Zbl 1211.90053
[29] Sivakumar, B., A perishable inventory system with retrial demands and a finite population, J. Comput. Appl. Math., 224, 1, 29-38, (2009) · Zbl 1152.90002
[30] Neuts, M. F., Matrix-geometric solutions in stochastic models: an algorithmic approach, (1994), Dover Publication Inc New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.