Abstract
We study an (s, S) production-inventory system with an attached Markovian service queue. A production facility gradually replenishes items in the inventory based on the (s, S) scheme, and the production process is assumed to be a Poisson process. In addition to the production-inventory system, c servers process customers that arrive in the system according to the Poisson process. The service times are assumed to be independent and identically distributed exponential random variables. The customers leave the system with exactly one item at the service completion epochs. If an item is unavailable, the customers cannot be served and must wait in the system. During this out-of-stock period, all newly arriving customers are lost. A regenerative process is used to analyze the proposed model. We show that the queue size and inventory level processes are independent in steadystate, and we derive an explicit stationary joint probability in product form. Probabilistic interpretations are presented for the inventory process. Finally, using mean performance measures, we develop cost models and show numerical examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altiok, T. (1989). R, r) production/inventory systems. Operations Research, 37(2), 266–276.
Baek, J. W., & Moon, S. K. (2014). The M/M/1 queue with a production–inventory system and lost sales. Applied Mathematics and Computation, 233(1), 534–544.
Bozer, Y., & McGinnis, L. (1992). Kitting versus line stocking: A conceptual framework and a descriptive model. International Journal of Production Economics, 28(1), 1–19.
Bryznér, H., & Johansson, M. (1995). Design and performance of kitting and order picking systems International Journal of Production Economics, 41(1–3), 115–125.
Harrison, J. M. (1973). Assembly-like queues. Journal of Applied Probability, 10(2), 354–367.
Krishnamoorthy, A., & Viswanath, N. C. (2013). Stochastic decomposition in production inventory with service time. European Journal of Operational Research, 228(2), 358–366.
Lipper, E. H., & Sengupta, B. (1986). Assembly-like queues with finite capacity: Bounds, asymptotics and approximations. Queueing Systems, 1(1), 67–83.
Saffari, M., Asmussen, S., & Haji, R. (2013). The M/M/1 queue with inventory, lost sale, and general lead times. Queueing Systems, 75(1), 65–77.
Saffari, M., Haji, R., & Hassanzadeh, F. (2011). A queueing system with inventory and mixed exponentially distributed lead times. The International Journal of Advanced Manufacturing Technology, 53(9–12), 1231–1237.
Schwarz, M., & Daduna, H. (2006). Queueing systems with inventory management with random lead times and with backordering. Mathematical Methods of Operations Research, 64(3), 383–414.
Schwarz, M., Sauer, C., Daduna, H., Kulik, R., & Szekli, R. (2006). M/M/1 Queueing systems with inventory. Queueing Systems, 54(1), 55–78.
Sigman, K., & Simchi-Levi, D. (1992). Light traffic heuristic for an M/G/1 queue with limited inventory. Annals of Operations Research, 40(1), 371–380.
Srivastava, H. M., & Kashyap, B. R. K. (1982). Special functions in queuing theory. New York: Academic Press.
Takács, L. (1962). Introduction to the theory of queues. London: Oxford University Press.
Takagi, H., & Tarabia, A. M. K. (2009). Explicit probability density function for the length of a busy period in an M/M/1/K queue. In Advances in queueing theory and network applications (pp. 213–226). New York: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baek, J.W., Moon, S.K. A production-inventory system with a Markovian service queue and lost sales. J. Korean Stat. Soc. 45, 14–24 (2016). https://doi.org/10.1016/j.jkss.2015.05.002
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1016/j.jkss.2015.05.002