Analytical and computational studies of the BMAP/G(a,Y)/1 queue

Study on Infinite Buffer Batch Size Dependent Bulk Service Queue with Queue Length Dependent Vacation

“…Neuts [22] proposed the GBS rule which is the most popular batch service rule in queueing literature in which the customers get serves in packets with lower threshold a (≥ 1) and upper threshold b. For the specific analysis of batch service queue, we mention Chaudhry and Templeton [5] and Medhi [21], and for the current status on the literature of batch service queue, readers are invoked to see [1][2][3]10,24] and the references therein. In the batch service queue, the idle period of the server may be utilized in a customized manner by entangling the server in some secondary job.…”

Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance

“…Two major classes of single-server batch service models studied in recent papers are the discrete-time (Claeys et al 2010a;Claeys et al 2010b;Claeys et al 2013;Banerjee et al 2014;Yu and Alfa 2015;Baetens et al 2016;Baetens et al 2017;Baetens et al 2018;Panda and Goswami 2020) and continuous-time models (Saxena et al 2018;D'Arienzo et al 2019;Banerjee and Gupta 2012;Banerjee et al 2015;Yu and Tang 2018;Pradhan and Gupta 2017;Pradhan et al 2016;Pradhan and Gupta 2019;Gupta et al 2020;Gupta and Banerjee 2019;Maity and Gupta 2015;Banik 2015;Vadivu and Arumuganathan 2015;Chaudhry et al 2016;Jeyakumar and Senthilnathan 2017;Zeng and Xia 2017;Niranjan et al 2018;Gupta and Banerjee 2018;Panda et al 2018;Ayyappan and Karpagam 2018;Ayyappan and Nirmala 2018;Bank and Samanta 2020;Xie et al 2020). The variety of techniques used for the analysis includes Kolmogorov equations, Supplementary variable techniques, Roots method, Matrix-Analytic Method, Embedded Markov chain analysis, Spectral methods, Asymptotic Quasi-Toeplitz Markov chain technique and Game theory, to name a few.…”

“…A notable exception is the paper (D'Arienzo et al 2019) where a retrial system is studied. Arrival process More analytically tractable are the memoryless arrival processes (Poisson in continuous time, and Geometric in discrete time case), but several works focus on general renewal processes, batch Poisson arrivals (Pradhan and Gupta 2017;Jeyakumar and Senthilnathan 2017;Ayyappan and Karpagam 2018;Ayyappan and Nirmala 2018), and, among the most general cases, the batch Markovian arrival process (BMAP) (Banik 2015;Bank and Samanta 2020), which though received less attention. Service time distribution In the majority of cases, the service time distribution is assumed to be general (e.g.…”

“…A specific version of the GBS rule (when a = b) is the Fixed Bulk Service (FBS) policy (Claeys et al 2010a;Yu and Tang 2018;Gupta and Banerjee 2019;Xie et al 2020). A significant attention is also received by the systems with variable capacity or the so-called versatile Bulk Service rule, where the batch size taken for service is random (Pradhan et al 2016;Maity and Gupta 2015;Jeyakumar and Senthilnathan 2017;Bank and Samanta 2020). Another interesting setup is considered in a series of papers (Baetens et al 2016(Baetens et al 2017(Baetens et al , 2018(Baetens et al , 2019, where the so-called two-class service policy was introduced.…”

On the joint distribution of an infinite-buffer discrete-time batch-size-dependent service queue with single and multiple vacation

“…A tremendous research is rapidly growing on batch-service queues for the betterment of human civilization, see e.g. Chaudhry and Gupta [9], Chang et al [10], Goswami et al [11,12], Germs and Foreest [13], Barbhuiya and Gupta [14], Bank and Samanta [15] and references therein. In recent times, a few researchers have focused on batchservice queues with batch-size-dependent service due to their usefulness in production and transportation, package delivery, group testing of blood/urine samples, etc.…”