Analytical and Computational Investigation of the GI/D-BMSP/1 Queueing System

Abstract

This paper investigates an infinite-buffer single server queueing system wherein customers arrive according to a discrete-time renewal process and are served in batches of random size under discrete batch Markovian service process. The server accommodates a dynamic range of customers within specified minimum and maximum capacities. The server has the flexibility to generate a random sized batch influenced by customer availability at the moment of service completion. To analyze the model, we first define a few matrices that are related to the completion of services during the inter-occurrence period of arriving customers and flourish the compact expressions for them. We then formulate vector difference equations at pre-arrival epoch and find efficient solutions to these difference equations using the matrix-geometric method. The Markov renewal theory is used to determine the queue-length distribution at random epoch. We are able to derive simple expressions for queue-length distributions at other significant time epochs by establishing relations among different time epochs. An important contribution of our work is the determination of the probability mass functions for the waiting time and service batch size of an arriving customer in an efficient manner. We also address the production of fasteners as a potential practical use of our batch-size dependent bulk service queue. An additional interesting result in our work is a comprehensive cost analysis which optimizes the least amount of service with a maximum efficiency. We provide a thorough description of parametrized computational studies to guarantee the validity of our analytical results.

Keywords

Discrete batch Markovian service process / random size batch service / matrix-geometric method / waiting time distribution / service batch size distribution / cost analysis

References

[1] Abolnikov L, Dukhovny A. Optimization in HIV screening problems. International Journal of Stochastic Analysis, 2003, 16: 361-374.

[2] Banerjee A, Gupta U C. Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service. Performance Evaluation, 2012, 69: 53-70.

[3] Banerjee A, Gupta U C, Chakravarthy S R. Analysis of a finite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service. Computers & Operations Research, 2015, 60: 138-149.

[4] Banerjee A, Gupta U C, Goswami V. Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service. Computers & Industrial Engineering, 2014, 75: 121-128.

[5] Banik A D. Analyzing state-dependent arrival in GI/BMSP/1/∞ queues. Mathematical and Computer Modelling, 2011, 53: 1229-1246.

[6] Banik A D. Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service. Journal of Systems Science and Systems Engineering, 2015, 24: 337-363.

[7] Banik A D, Chaudhry M L, Gupta U C. On the finite buffer queue with renewal input and batch Markovian service process: GI/BMSP/1/N. Methodology and Computing in Applied Probability, 2008, 10: 559-575.

[8] Banik A D, Chaudhry M L, Gupta U C. Finite-buffer bulk service queue under Markovian service process: GI/MSP ^(a,b)/1/N. Stochastic Analysis and Application, 2009, 27: 500-522.

[9] Banik A D, Ghosh S, Chaudhry M L. On the optimal control of loss probability and profit in a GI/CBMSP/1/N queueing system. OPSEARCH, 2020, 57: 144-162.

[10] Bank B, Samanta S K. Performance analysis of a versatile correlated batch-arrival and batch-service queue. Queueing Models and Service Management, 2021, 4: 1-30.

[11] Bar-Lev S K, Parlar M, Perry D, Stadje W, Van der Duyn Schouten F A. Applications of bulk queues to group testing models with incomplete identification. European Journal of Operational Research, 2007, 183: 226-237.

[12] Bhaskar V, Lallement P. Modeling a supply chain using a network of queues. Applied Mathematical Modelling, 2010, 34: 2074-2088.

[13] Brown S M, Hanschke T, Meents I, Wheeler B R, Zisgen H. Queueing model improves IBM's semiconductor capacity and lead-time management. Interfaces, 2010, 40: 397-407.

[14] Chao X, Pinedo M. Networks of queues with batch services, signals and product formsolutions. Operations Research Letters, 1995, 17: 237-242.

[15] Chaplygin V. The mass-service G/BMSP/1/r. Information Processing, 2003, 3: 97-108.

[16] Chaudhry M L, Banik A D, Pacheco A, Ghosh S. A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: GI/C-MSP ^(a,b)/1/∞. RAIRO - Operations Research, 2016, 50: 519-551.

[17] Çinlar E. Introduction to Stochastic Process, 1975, New Jersey: Prentice Hall

[18] Claeys D, Steyaert B, Walraevens J, Laevens K, Bruneel H. Tail probabilities of the delay in a batchservice queueing model with batch-size dependent service times and a timer mechanism. Computers & Operations Research, 2013, 40: 1497-1505.

[19] Claeys D, Walraevens J, Laevens K, Bruneel H. Discrete-time queueing model with a batch server operating under the minimum batch size rule. Lecture Notes in Computer Science, 2010, 4712: 248-259.

[20] Claeys D, Walraevens J, Steyaert B, Bruneel H. Applicability of a static model in a dynamic context in group-screening decision making. Computers & Operations Research, 2014, 51: 313-322.

[21] Das K, Samanta S K. Modelling and analysis of D-BMAP/D-MSP/1 queue using RG-factorization. Quality Technology & Quantitative Management, 2021, 18: 355-381.

[22] Gail H R, Hantler S L, Taylor B A. Spectral analysis of M/G/1 and G/M/1 type Markov chains. Advances in Applied Probability, 1996, 28: 114-165.

[23] Goswami V, Laxmi P V. Performance analysis of discrete-time GI/D-MSP ^a,b/1/N queue. International Journal of Applied Decision Sciences, 2010, 3: 400-420.

[24] Grassmann W K, Drekic S. Multiple eigenvalues in spectral analysis for solving QBD processes. Methodology and Computing in Applied Probability, 2008, 10: 73-83.

[25] Gupta G K, Banerjee A, Gupta U C. On finite-buffer batch-size-dependent bulk service queue with queue-length dependent vacation. Quality Technology & Quantitative Management, 2020, 17: 501-527.

[26] Gupta U C, Kumar N, Pradhan S, Barbhuiya F P, Chaudhry M L. Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process. RAIRO - Operations Research, 2021, 55: 1231-1256.

[27] Gupta U C, Samanta S K, Goswami V. Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process. Journal of the Korean Statistical Society, 2014, 43: 545-557.

[28] Hall R W. Hall RW. Transportation queueing. Handbook of Transportation Science, 1999, Boston: Springer.

[29] He Q M. Construction of continuous time Markovian arrival processes. Journal of Systems Science and Systems Engineering, 2010, 19: 351-366.

[30] Koo P H, Moon D H. A review on control strategies of batch processing machines in semiconductor manufacturing. Proceeding of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control International Federation of Automatic Control, 2013, Russia: Saint Petersburg

[31] Krishnamoorthy A, Joshua A N. A BMAP/BMSP/1 queue with Markov dependent arrival and Markov dependent service batches. Journal of Industrial and Management Optimization, 2021, 17: 2925-2941.

[32] Krishnamoorthy A, Joshua A N, Kozyrev D. Analysis of a batch arrival, batch service queuing-inventory system with processing of inventory while on vacation. Mathematics, 2021, 9: 419.

[33] Li Q, Chang Y, Wu X, Zhang G. A new theoretical framework of pyramid Markov processes for blockchain selfish mining. Journal of Systems Science and Systems Engineering, 2021, 30: 667-711.

[34] Lucantoni D M, Neuts M F. Some steady-state distributions for the MAP/SM/1 queue. Stochastic Models, 1994, 10: 575-598.

[35] Mitrani I, Chakka R. Spectral expansion solution for a class of Markov models: Application and comparison with the matrix geometric method. Performance Evaluation, 1995, 23: 241-260.

[36] Neuts M F. Matrix-geometric Solutions in Stochastic Models, 1981, Baltimore: Johns Hopkins University Press

[37] Nishimura S, Tominaga H, Shigeta T. A computational method for the boundary vector of a BMAP/G/1 queue. Journal of the Operations Research Society of Japan, 2006, 49: 83-97.

[38] Panda G, Goswami V. Analysis of a discrete-queue with modified batch service policy and batch-sizedependent service. Methodology and Computing in Applied Probability, 2023, 25: 5.

[39] Pradhan S, Gupta U C. Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process. Annals of Operations Research, 2019, 277: 161-196.

[40] Pradhan S, Gupta U C. Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process. Communications in Statistics - Theory and Methods, 2022, 51: 4330-4357.

[41] Pradhan S, Gupta U C, Samanta S K. Queue-length distribution of a batch service queue with random capacity and batch size dependent service: M/G _r ^Y /1. OPSEARCH, 2015, 53: 329-343.

[42] Samanta S K, Bank B. Modelling and analysis of GI/BMSP/1 queueing system. Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44: 3777-3807.

[43] Samanta S K, Chaudhry M L, Pacheco A, Gupta U C. Analytic and computational analysis of the discretetime GI/D-MSP/1 queue using roots. Computers & Operations Research, 2015, 56: 33-40.

[44] Samanta S K, Das K. Computing stationary distributions of the D-MAP/D-MSP ^(a,b)/1 queueing system. Journal of Ambient Intelligence and Humanized Computing, 2022, 13: 571-590.

[45] Samanta S K, Das K. Detailed analytical and computational studies of D-BMAP/D-BMSP/1 queueing system. Methodology and Computing in Applied Probability, 2023, 2512: 1-37.

[46] Samanta S K, Nandi R. Queue-length, waiting-time and service batch size analysis for the discrete-time GI/D-MSP ^(a,b)/1/∞ queueing system. Methodology and Computing in Applied Probability, 2021, 23: 1461-1488.

[47] Sandhya R, Sundar V, Rama G, Ramshankar R, Ramanarayanan R. BMAP/BMSP/1 queue with randomly varying environment. IOSR Journal of Engineering, 2015, 5: 1-12.

[48] Santhi K, Saravanan R. Performance analysis of cloud computing bulk service using queueing models. International Journal of Applied Engineering Research, 2017, 12: 6492

[49] Shanthikumar J G, Ding S, Zhang M T. Queueing theory for semiconductor manufacturing systems: A survey and open problems. IEEE Transactions on Automation Science and Engineering, 2007, 4: 513-522.

[50] Singh G, Kumari A, Gupta U C. Stationary system-length distribution of Markovian bulk service queue with modified bulk service rule and dynamic service rates. International Journal ofComputer Mathematics: Computer Systems Theory, 2022, 7: 42-62.

[51] Wang Y C, Cai D L, Chiang L H, Hu C W. Elucidating the short term loss behaviour of Markovian-modulated batch-service queueing model with discrete-time batch Markovian arrival process. Mathematical Problems in Engineering, 2014, 2014: 1-10.