We consider a queueing-inventory problem with Markovian arrival process, phase type distributed service time. The life time of items is exponentially distributed; all items perish together which means they have a common life time. Reservation (purchase) and cancellation of purchased items is permitted as long as the common life time is not realized. In addition overbooking of items upto a certain maximum is also permitted. When system is fully overbooked waiting customers tend to leave the system. On realization of common life time, instantly S items are procured resulting in the commencement of next cycle. In the particular case of Poisson process and exponentially distributed service time we show that the system admits asymptotic product form solution. System state characteristics are computed which are then numerically illustrated for different sets of values for the input parameters.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Arivarignan G, Elango C, Arumugam N (2002) A continuous review perishable inventory control system at service facilities. In: Artalejo JR, Krishnamoorthy A (eds) Advances in stochastic modelling. Notable Publications, Branchburg, pp 29–40
Baek JW, Moon SK (2014) The \(M/M/1\) queue with a production-inventory system and lost sales. Appl Math Comput 233:534–544
Berman O, Kaplan EH, Shimshak DG (1993) Deterministic approximations for inventory management at service facilities. IIE Trans 25(5):98–104
Berman O, Kim E (1999) Stochastic models for inventory managements at service facilities. Commun Stat Stoch Models 15(4):695–718
Berman O, Sapna KP (2002) Optimal service rates of a service facility with perishable inventory items. Naval Res Logist 49:464–482
Chakravarthy SR (2001) The batch Markovian arrival process: a review and future work. In: Krishnamoorthy A et al (eds) Advances in probability theory and stochastic process: proc. Notable Publications, Branchburg, pp 21–49
Chakravarthy SR, Krishnamoorthy A, Joshua VC (2006) Analysis of a multi-server retrial queue with search of customers from the orbit. Perform Eval 63:776–798
Chakravarthy SR, Maity A, Gupta UC (2017) An \((s, S)\) inventory in a queueing system with batch service facility. Ann Oper Res 258(2):263–283
Krenzler R (2016) Queueing systems in a random environment, Doctoral thesis in Hamburg University
Krenzler R, Daduna H (2015) Loss systems in a random environment steady-state analysis. Queueing Syst 80(1–2):127–153
Krishnamoorthy A, Benny B, Shajin D (2016) A revisit to queueing-inventory system with reservation, cancellation, common life time. OPSEARCH 53(1):85–102. https://doi.org/10.1007/s12597-016-0278-1
Krishnamoorthy A, Shajin D (2016) Stochastic decomposition in retrial queueing inventory system. QTNA 16(December):13–15. https://doi.org/10.1145/3016032.3016043
Krishnamoorthy A, Shajin D, Lakshmy B (2016) On a queueing-inventory with reservation, cancellation, common life time and retrial. Ann Oper Res 247(1):365–389
Krishnamoorthy A, Shajin D, Lakshmy B (2016) \(GI/M/1\) type queueing-inventory systems with postponed work, reservation, cancellation and common life time. Indian J Pure Appl Math 47(2):357–388
Krishnamoorthy A, Shajin D, Melikov AZ (2018) On partial and complete blocking set of states in queueing-inventory model (communicated)
Krishnamoorthy A, Lakshmy B, Manikandan R (2011) A survey on inventory models with positive service time. OPSEARCH 48(2):153–169
Krishnamoorthy A, Viswanath CN (2013) Stochastic decomposition in production inventory with service time. Eur J Oper Res 228(2):358–366. https://doi.org/10.1016/j.ejor.2013.01.041
Melikov AZ, Molchanov AA (1992) Stock optimization in transportation/storage systems. Cybern Syst Anal 28(3):484–487
Neuts MF (1981) Matrix-geometric solutions in stochastic models: an algorithmic approach. The Johns Hopkins University Press, Baltimore [1994 version is Dover Edition]
Saffari M, Asmussen S, Haji R (2013) The M/M/1 queue with inventory, lost sale and general lead times. Queueing Syst 75:65–77
Schwarz M, Sauer C, Daduna H, Kulik R, Szekli R (2006) M/M/1 queueing systems with inventory. Queueing Syst 54:55–78
Schwarz M, Wichelhaus C, Daduna H (2007) Product form models for queueing networks with an inventory. Stoch Models 23(4):627–663
Sigman K, Simchi-Levi D (1992) Light traffic heuristic for an M/G/1 queue with limited inventory. Ann Oper Res 40:371–380
Shajin D, Benny B, Deepak TG, Krishnamoorthy A (2016) A relook at queueing-inventory system with reservation, cancellation and common life time. Commun Appl Anal 20:545–574
Shajin D, Krishnamoorthy A, Manikandan R (2018) \(MAP/PH/1\) Queueing-inventory with common life time and Markovian lead time (communicated)
The authors thank the reviewers for their critical comments and suggestions that lead to vast improvement in the presentation of the paper.
D. Shajin: Research supported by Kerala State Council for Science, Technology and Environment: 001-07/PDF/2016/KSCSTE in Department of Mathematics, CMS College, Kottayam-686001, India.
A. Krishnamoorthy: Research supported by UGC No.F.6-6/2017-18/EMERITUS-2017-18-GEN-10822 (SA-II).
About this article
Cite this article
Shajin, D., Krishnamoorthy, A. On a queueing-inventory system with impatient customers, advanced reservation, cancellation, overbooking and common life time. Oper Res Int J 21, 1229–1253 (2021). https://doi.org/10.1007/s12351-019-00475-3