×

A queueing model with randomized depletion of inventory. (English) Zbl 1370.90083

Summary: In this paper, we study an \(M/M/1\) queue, where the server continues to work during idle periods and builds up inventory. This inventory is used for new arriving service requirements, but it is completely emptied at random epochs of a non-homogeneous Poisson process, whose rate depends on the current level of the acquired inventory. For several shapes of depletion rates, we derive differential equations for the stationary density of the workload and the inventory level and solve them explicitly. Finally, numerical illustrations are given for some particular examples, and the effects of this depletion mechanism are discussed.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
90B05 Inventory, storage, reservoirs

Software:

DLMF
Full Text: DOI

References:

[1] 1.AbramowitzM. & StegunI.A. (1964). Handbook of mathematical functions with formulas, graphs and mathematical tables. New York, NY: Dover Publications. · Zbl 0171.38503
[2] 2.AlbrecherH. & LautschamV. (2013). From ruin to bankruptcy for compound Poisson surplus processes. ASTIN Bulletin43: 213-243.10.1017/asb.2013.4 · Zbl 1283.91084 · doi:10.1017/asb.2013.4
[3] 3.AlbrecherH., CheungE.C.K., & ThonhauserS. (2013). Randomized observation periods for the compound Poisson risk model: the discounted penalty function. Scandinavian Actuarial Journal6: 424-452. · Zbl 1401.91089
[4] 4.AlbrecherH., GerberH.U., & ShiuE.S.W. (2011). The optimal dividend barrier in the Gamma-Omega model. European Actuarial Journal1: 43-55.10.1007/s13385-011-0006-4 · Zbl 1219.91062 · doi:10.1007/s13385-011-0006-4
[5] 5.AsmussenS. & AlbrecherH. (2010). Ruin probabilities. Hackensack, NJ: World Scientific. · Zbl 1247.91080
[6] 6.BermanO. & KimE. (2001). Dynamic order replenishment policy in internet-based supply chains. Mathematical Methods of Operations Research53: 371-390.10.1007/s001860100116 · Zbl 1036.90017 · doi:10.1007/s001860100116
[7] 7.BermanO., ParlarM., PerryD., & PosnerM.J.M. (2005). Production/clearing models under continuous and sporadic review. Methodology and Computing in Applied Probability7: 203-224.10.1007/s11009-005-1483-1 · Zbl 1081.90002 · doi:10.1007/s11009-005-1483-1
[8] 8.BoxmaO.J., EssifiR., & JanssenA.J.E.M. (2015). A queueing/inventory and an insurance risk model. To appear in Journal of Applied Probability · Zbl 1358.60095
[9] 9.DoshiB.T. (1992). Level crossing analysis of queues. In U.N.Bhat & I.V.Basawa (eds.), Queueing and related models, Oxford: Clarendon Press, pp. 3-33 · Zbl 0783.60093
[10] 10.MohebbiE. & PosnerM.J.M. (1998). A continuous-review inventory system with lost sales and variable lead time. Naval Research Logistics45: 259-278.10.1002/(SICI)1520-6750(199804)45:3<259::AID-NAV2>3.0.CO;2-6 · Zbl 0941.90001 · doi:10.1002/(SICI)1520-6750(199804)45:3<259::AID-NAV2>3.0.CO;2-6
[11] 11.OlverF.W.J., LozierD.W., BoisvertR.F., & ClarkC.W. (2010). NIST handbook of mathematical functions. NIST, New York, NY: Cambridge University Press. · Zbl 1198.00002
[12] 12.PerryD., StadjeW., & ZacksS. (2005). Sporadic and continuous clearing policies for a production/inventory system under an M/G demand process. Mathematics of Operations Research30: 354-368.10.1287/moor.1040.0123 · Zbl 1082.90007 · doi:10.1287/moor.1040.0123
[13] 13.PolyaninA.D., & ZaitsevV.F. (2003). Handbook of exact solutions for ordinary differential equations, 2nd ed.Boca Raton, FL: CRC Press. · Zbl 1024.35001
[14] 14.SaffariM., AsmussenS., & HajiR. (2013). The M/M/1 queue with inventory, lost sale, and general lead times. Queueing Systems75: 65-77.10.1007/s11134-012-9337-3 · Zbl 1273.60112 · doi:10.1007/s11134-012-9337-3
[15] 15.SahinI. (1990). Regenerative inventory systems, operating characteristics and optimization, New York, NY: Springer. · Zbl 0713.90024
[16] 16.SchwarzM. & DadunaH. (2006). Queueing systems with inventory management with random lead times and with backordering. Mathematical Methods of Operations Research64: 383-414.10.1007/s00186-006-0085-1 · Zbl 1131.90018 · doi:10.1007/s00186-006-0085-1
[17] 17.SchwarzM., SauerC., DadunaH., KulikR., & SzekliR. (2006). M/M/1 queueing systems with inventory. Queueing Systems54: 55-78.10.1007/s11134-006-8710-5 · Zbl 1137.90429 · doi:10.1007/s11134-006-8710-5
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.