An \((S-1, S)\) inventory system with negative arrivals and multiple vacations. (English) Zbl 1428.90011
Summary: In this paper, we consider a continuous review one-to-one ordering policy inventory system with multiple vacations and negative customers. The maximum storage capacity is \(S\). The customers arrive according to a Poisson process with finite waiting hall. There are two types of customers: ordinary and negative. An ordinary customer, on arrival, joins the queue and the negative customer does not join the queue and takes away any one of the waiting customers. When the waiting hall is full, the arriving primary customer is considered to be lost. The service time and lead time are assumed to have independent exponential distribution. When the inventory becomes empty, the server takes a vacation and the vacation duration is exponentially distributed. The stationary distribution of the number of customers in the waiting hall, the inventory level and the server status for the steady state case. Some system performance measures and numerical illustrations are discussed.
MSC:
| 90B05 | Inventory, storage, reservoirs |
| 60J27 | Continuous-time Markov processes on discrete state spaces |
Keywords:
base stock policy; positive leadtime; continuous review inventory system; multiple vacations; negative customersReferences:
| [1] | Artalejo, J. R. (2000). G-networks: A versatile approach for work removal in queueing networks, European J. Oper. Res, Vol. 126, pp. 233-249. · Zbl 0971.90007 |
| [2] | Berman, O. and Kim, E. (1999). Stochastic models for inventory management of service facilities, Stochastic Models, Vol. 15, pp. 695-718. · Zbl 0934.90002 |
| [3] | Berman, O. and Sapna, K.P. (2000). Inventory management at service fa cility for systems with arbitrarily distributed service times, Communications in Statistics and Stochastic Models, Vol. 16, No. 3, pp. 343-360. · Zbl 0959.90001 |
| [4] | Chao, X., Miyazawa, M. and Pinedo, M. (1999).Queueing networks: Customers, Signal and Product Form Solutions, Wiley, Chichester. · Zbl 0936.90010 |
| [5] | Daniel, J. K. and Ramanarayanan, R. (1987). An inventory system with two servers and rest periods, Cahiers du C.E.R.O, Universite Libre De Bruxelles, Vol. 29, pp. 95-100. · Zbl 0641.90032 |
| [6] | Daniel, J. K. and Ramanarayanan, R. (1988). An inventory system with rest periods to the server, Naval Research Logistics, John Wiley and Sons, Vol. 35, pp. 119-123. · Zbl 0637.90031 |
| [7] | Gaver, D.P., Jacobs, P. A. and Latouche, G. (1984). Finite birth-and-death models in randomly changing environments, Advances in Applied Probability, Vol. 16, pp. 715 - 731. · Zbl 0554.60079 |
| [8] | Gelenbe, E. (1991). Production-form queueing networks with negative and positive customers, J. Appl. Prob, Vol. 30, pp. 742 - 748. · Zbl 0781.60088 |
| [9] | Gelenbe, E. and Pujolle, G. (1998).Introduction to queueing networks, (Second Edition), Wiley Chichester. · Zbl 0654.60079 |
| [10] | Gomathi, D., Jeganathan, K. and Anbazhagan, N. (2012). Two-commodity inventory system for base-stock policy with service facility, Global Journal of Science Frontier Research (F), Vol. XII, No. I, pp. 69-79. |
| [11] | Jeganathan, K. Anbazhagan, N. and Kathiresan, J. (2013). A retrial inventory system with nonpreemptive priority service, International Journal of Information and Management Sciences, Vol. 24, pp. 57-77. · Zbl 1395.90011 |
| [12] | Jeganathan, K., Kathiresan, J. and Anbazhagan, N. (2016). A retrial inventory system with priority customers and second optional service, OPSEARCH, Vol. 53, pp. 808-834. · Zbl 1360.90013 |
| [13] | Kalpakam, S. and Arivarignan, G. (1998). The(S−1, S)inventory system with lost sales, Proc. of the Int. Conf. on Math. Mod. Sci. and Tech, Vol. 2, pp. 205-212. |
| [14] | Kalpakam, S. and Sapna, K.P. (1995). (S-1, S) perishable system with stochastic lead times, Mathl. Comput. Modelling, Vol. 21, No. 6, pp. 95-104. · Zbl 0822.90048 |
| [15] | Kalpakam, S. and Sapna, K.P. (1996). An (S-1, S) perishable inventory system with renewal demands, Naval Research Logistics, Vol. 43, pp. 129-142. · Zbl 0870.90053 |
| [16] | Kalpakam, S. and Shanthi, S. (2000). A perishable system with modified base stock policy and random supply quantity, Computers and Mathematics with Applications, Vol. 39, pp. 79-89. · Zbl 0970.90007 |
| [17] | Krishnamoorthy, A. and Anbazhagan, N. (2008). Perishable inventory system at service facility with N policy, Stochastic Analysis and Applications, Vol. 26, pp. 1-17. · Zbl 1135.90001 |
| [18] | Narayanan, V. C., Deepak, T. G., Krishnamoorthy, A. and Krishnakumar, B. (2008). On an(s, S) inventory policy with service time, vacation to server and correlated lead time, Qualitative Technology and Quantitative Management, Vol. 5, No. 2, pp. 129-143. |
| [19] | Padmavathi, I., Sivakumar, B. and Arivarignan, G. (2015). A retrial inventory system with single and modified multiple vacation for server, Annals of Operation Research, Vol. 233, No. 1, pp. 335-364. · Zbl 1327.90012 |
| [20] | Pal, M. (1989). The(S−1, S)inventory model for deteriorating items with exponential leadtime, Calcutta Statistical Association Bulletin, Vol. 38, pp. 149-150. · Zbl 0722.90023 |
| [21] | Rustamov, A. and Adamov, A. (2017). Numerical method to analysis of perishable queueinginventory systems with server vacations, IEEE 11th International Conference on Application of Information and Communication Technologies (AICT). |
| [22] | Schmidt, C.P. and Nahmias, S. (1985).(S−1, S)Policies for perishable inventory, Management Science, Vol. 31, pp. 719-728. · Zbl 0615.90035 |
| [23] | Sivakumar, B. (2011). An inventory system with retrial demands and multiple server vacation, Quality Technology and Quantitative Management, Vol. 8, pp. 125-146. |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
