36
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A new method for computing the sojourn times in the MAP/M/1 queues with three types of negative customers

&
Received 28 Jan 2023, Accepted 26 Jan 2024, Published online: 09 Feb 2024

References

  • Artalejo, J. R. (2000). G-networks: A versatile approach for work removal in queueing networks. European Journal of Operational Research, 126(2), 233–249. https://doi.org/10.1016/S0377-2217(99)00476-2
  • Artalejo, J. R., & Economou, A. (2004). Optimal control and performance analysis of an MX/M/1 queue with batches of negative customers. RAIRO-Operations Research, 38(2), 121–151. https://doi.org/10.1051/ro:2004016
  • Atencia, I., & Moreno, P. (2005). A single-server G-queue in discrete-time with geometrical arrival and service process. Performance Evaluation, 59(1), 85–97. https://doi.org/10.1016/j.peva.2004.07.019
  • Boucherie, R. J., & Boxma, O. J. (1996). The workload in the M/G/1 queue with work removal. Probability in the Engineering and Informational Sciences, 10(2), 261–277. https://doi.org/10.1017/S0269964800004320
  • Chakravarthy, S. R. (2001). The batch markovian arrival process: A review and future work. Advances in Probability Theory and Stochastic Processes, 1(1), 21–49.
  • Chao, X., Miyazawa, M., Pinedo, M., & Scrfozo, R. F. (2001). Queueing networks: Customers, signals and product form solutions. Journal of Applied Mathematics and Stochastic Analysis, 14(4), 421–426. https://doi.org/10.1155/S1048953301000351
  • Cordeiro, J. D., & Kharoufeh, J. P. (2011). Batch markovian arrival processes (BMAP). In J. J. Cochran, L. A. Cox, P. Keskinocak, J. P. Kharonfeh, & J. C. Smith (Eds.), Wiley encyclopedia of operations research and management science. John Wiley & Sons Inc.
  • DiCrescenzo, A., Giorno, V., Nobile, A. G., & Ricciardi, L. M. (2003). On the M/M/1 queue with catastrophes and its continuous approximation. Queueing Systems, 43(4), 329–347. https://doi.org/10.1023/A:1023261830362
  • Dudin, A., & Nishimura, S. (1999). A BMAP/SM/1 queueing system with markovian arrival input of disasters. Journal of Applied Probability, 36(3), 868–881. https://doi.org/10.1239/jap/1032374640
  • Gelenbe, E. (1989). Random neural networks with negative and positive signals and product form solution. Neural Computation, 1(4), 502–510. https://doi.org/10.1162/neco.1989.1.4.502
  • Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. Journal of Applied Probability, 28(3), 656–663. https://doi.org/10.2307/3214499
  • Gelenbe, E. (2000). The first decade of G-networks. European Journal of Operational Research, 126(2), 231–232. https://doi.org/10.1016/S0377-2217(99)00475-0
  • Gelenbe, E., Glynn, P., & Sigman, K. (1991). Queues with negative arrivals. Journal of Applied Probability, 28(1), 245–250. https://doi.org/10.2307/3214756
  • Gupta, U. C., Kumar, N., & Barbhuiya, F. P. (2020). A queueing system with batch renewal input and negative arrivals. In V. Joshua, S. Varadhan, & V. Vishnevsky (Eds.), Applied probability and stochastic processes. Springer.
  • Harrison, P. G., Patel, N. M., & Pitel, E. (2000). Reliability modelling using G-queues. European Journal of Operational Research, 126(2), 273–287. https://doi.org/10.1016/S0377-2217(99)00478-6
  • Harrison, P. G., & Pitel, E. (1993). Sojourn times in single-server queues by negative customers. Journal of Applied Probability, 30(4), 943–963. https://doi.org/10.2307/3214524
  • Harrison, P. G., & Pitel, E. (1996). The M/G/1 queue with negative customers. Advances in Applied Probability, 28(2), 540–566. https://doi.org/10.2307/1428071
  • Krishna Kumar, B., Pavai Madheswari, S., & Anantha Lakshmi, S. R. (2013). An M/G/1 Bernoulli feedback retrial queueing system with negative customers. Operational Research, 13(2), 187–210. https://doi.org/10.1007/s12351-011-0107-5
  • Kumar, N., Barbhuiya, F. P., & Gupta, U. C. (2020). Unified killing mechanism in a single server queue with renewal input. Opsearch, 57(1), 246–259. https://doi.org/10.1007/s12597-019-00408-w
  • Kumar, N., & Gupta, U. C. (2022). Markovian arrival process subject to renewal generated binomial catastrophes. Methodology and Computing in Applied Probability, 24(4), 2287–2312. https://doi.org/10.1007/s11009-022-09929-2
  • Kumar, N., & Gupta, U. C. (2023). Analysis of BMAP/MSP/1 queue with MAP generated negative customers and disasters. Communications in Statistics-Theory and Methods, 52(12), 4283–4309. https://doi.org/10.1080/03610926.2021.1990953
  • Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. Society for Industrial and Applied Mathematics.
  • Lee, D. H., Park, H. M., & Lim, D. E. (2015). Queue length and busy period analysis for the M/G/1 queue with negative arrivals. Indian Journal of Science and Technology, 8(34), 1–5. https://doi.org/10.17485/ijst/2015/v8i27/73132
  • Li, Q. L. (2010). Constructive computation in stochastic models with applications: The RG-factorizations. Springer.
  • Li, K., & Wang, J. (2021). Equilibrium balking strategies in the single-server retrial queue with constant retrial rate and catastrophes. Quality Technology & Quantitative Management, 18(2), 156–178. https://doi.org/10.1080/16843703.2020.1760464
  • Li, Q. L., & Zhao, Y. Q. (2004). A MAP/G/1 queue with negative customers. Queueing Systems, 47(1), 5–43. https://doi.org/10.1023/B:QUES.0000032798.65858.19
  • Lucantoni, D. M. (1991). New results on the single server queue with a batch markovian arrival process. Communications in Statistics, Stochastic Models, 7(1), 1–46. https://doi.org/10.1080/15326349108807174
  • Narayana, S., & Neuts, M. F. (1992). The first two moment matrices of the counts for the Markovian arrival process. Communications in Statistics, Stochastic Models, 8(3), 459–477. https://doi.org/10.1080/15326349208807234
  • Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Johns Hopkins University Press.
  • Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. CRC Press.
  • Ouazine, S., & Abbas, K. (2015). Sensitivity analysis of the GI/M/1 queue with negative customers. In L. Filus, T. Oliveira, & C. H. Skiadas (Eds.), Stochastic modeling data analysis & statistical applications. ISAST.
  • Ramswami, V., & Latouche, G. (1996). A general class of Markov processes with explicit matrix-geometric solutions. Operations-Research-Spektrum, 8(4), 209–218. https://doi.org/10.1007/BF01721131
  • Shin, Y. W. (1998). Sojourn time distributions for M/M/c G-queue. Communications of the Korean Mathematical Society, 13(2), 405–434.
  • Shin, Y. W. (1999). Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal. Journal of Applied Mathematics and Stochastic Analysis, 12(4), 339–356. https://doi.org/10.1155/S1048953399000301
  • Shin, Y. W. (2004). BMAP/G/1 queue with correlated arrivals of customers and disasters. Operations Research Letters, 32(4), 364–373. https://doi.org/10.1016/j.orl.2003.09.005
  • Shin, Y. W. (2006). An MMAP [3]/PH/1 queue with negative customers and disasters. Bulletin of the Korean Mathematical Society, 43(2), 277–292. https://doi.org/10.4134/BKMS.2006.43.2.277
  • Soujanya, M. L. (2015). Perishable inventory system with service interruptions, retrial demands and negative customers. Applied Mathematics and Computation, 262, 102–110. https://doi.org/10.1016/j.amc.2015.04.013
  • Soujanya, M. L., Laxmi, P. V., & Sirisha, E. (2021). Impact of negative arrivals and multiple working vacation on dual supplier inventory model with finite lifetimes. Reliability: Theory & Applications, 16(1), 124–132.
  • Sun, K., & Wang, J. (2022). Game-theoretic analysis of the single vacation queue with negative customers. Quality Technology & Quantitative Management, 19(4), 403–427. https://doi.org/10.1080/16843703.2021.1951952
  • Vijaya Laxmi, P., & Soujanya, M. L. (2017). Retrial inventory model with negative customers and multiple working vacations. International Journal of Management Science and Engineering Management, 12(4), 237–244. https://doi.org/10.1080/17509653.2016.1233837
  • Wang, J., Liu, B., & Li, J. (2008). Transient analysis of an M/G/1 retrial queue subject to disasters and server failures. European Journal of Operational Research, 189(3), 1118–1132. https://doi.org/10.1016/j.ejor.2007.04.054
  • Wang, F., Wang, J., & Zhang, F. (2015). Strategic behavior in the single-server constant retrial queue with individual removal. Quality Technology & Quantitative Management, 12(3), 325–342. https://doi.org/10.1080/16843703.2015.11673384
  • Wang, Y., Wang, J., & Zhang, G. (2023). The effect of information on the strategic behavior in a Markovian queue with catastrophes and working vacations. Quality Technology & Quantitative Management, 1–34. https://doi.org/10.1080/16843703.2023.2243199
  • Wang, J., & Zhang, P. (2009). A discrete-time retrial queue with negative customers and unreliable server. Computers & Industrial Engineering, 56(4), 1216–1222. https://doi.org/10.1016/j.cie.2008.07.010
  • Wu, J., Liu, Z., & Yang, G. (2011). Analysis of the finite source MAP/PH/N retrial G-queue operating in a random environment. Applied Mathematical Modelling, 35(3), 1184–1193. https://doi.org/10.1016/j.apm.2010.08.006
  • Yadavalli, V. S., Sivakumar, B., Arivarignan, G., & Adetunji, O. (2011). A multi-server perishable inventory system with negative customer. Computers & Industrial Engineering, 61(2), 254–273. https://doi.org/10.1016/j.cie.2010.07.032
  • Yang, W. S., & Chae, K. C. (2001). A note on the GI/M/1 queue with Poisson negative arrivals. Journal of Applied Probability, 38(4), 1081–1085. https://doi.org/10.1239/jap/1011994196

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.