Abstract
This paper considers a single-server batch-service queue with random service capacity of the server and service time depends on the size of the batch. Customers arrive according to Poisson process and service times of the batches are generally distributed. We obtain explicit closed-form expression for the steady-state queue-length distribution at departure epoch of a batch based on roots of the associated characteristic equation of the probability generating function. Moreover, we also discuss the case when the characteristic equation has non-zero multiple roots. The queue-length distribution at random epoch is obtained using the classical principle based on ‘rate in = rate out’ approach. Finally, variety of numerical results are presented for a number of service time distributions including gamma distribution.
Similar content being viewed by others
References
Banerjee, A., Gupta, U.: Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service. Perform. Eval. 69(1), 53–70 (2012)
Banerjee, A., Gupta, U., Sikdar, K.: Analysis of finite–buffer bulk–arrival bulk–service queue with variable service capacity and batch–size–dependent service: \({M^{X}/{G^{Y}_{r}}/1/N}\). International Journal of Mathematics in Operational Research 5(3), 358–386 (2013)
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. Eur. J. Oper. Res. 183(1), 226–237 (2007)
Bruneel, H., Steyaert, B., Desmet, E., Petit, G.: Analytic derivation of tail probabilities for queue lengths and waiting times in atm multiserver queues. Eur. J. Oper. Res. 76(3), 563–572 (1994)
Chang, S.H., Choi, D.W.: Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times: The M X/G Y/1/K+B queue with setup times. INFORMS J. Comput. 18(2), 218–228 (2006)
Chaudhry, M, Gai, J: A simple and extended computational analysis of \({M/G_{j}^{a,b}/1}\) and \({M/G_{j}^{a, b}/1/B+ b}\) queues using roots. INFOR: Information Systems and Operational Research 50(2), 72–79 (2012)
Claeys, D., Walraevens, J., Laevens, K., Bruneel, H.: A queueing model for general group screening policies and dynamic item arrivals. Eur. J. Oper. Res. 207(2), 827–835 (2010)
Claeys, D., Steyaert, B., Walraevens, J., Laevens, K., Bruneel, H.: Analysis of a versatile batch-service queueing model with correlation in the arrival process. Perform. Eval. 70(4), 300–316 (2013a)
Claeys D., Steyaert B., Walraevens J., Laevens K., Bruneel, H.: Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism. Comput. Oper. Res. 405, 1497–1505 (2013b)
Desmet, E., Steyaert, B., Bruneel, H., Petit, G.: Tail distributions of queue length and delay in discrete-time multiserver queueing models, applicable in atm networks, vol. 13, pp 1–6 (1991)
Germs, R., van Foreest, N.: Analysis of finite-buffer state-dependent bulk queues. OR Spectrum 35(3), 563–583 (2013)
Germs, R., Van Foreest, N.: Loss probabilities for the M X/G Y/1/K+B bulk queue. Probab. Eng. Inf. Sci. 24(04), 457–471 (2010)
Ho Chang, S., Won Choi, D., Kim, T.S.: Performance analysis of a finite-buffer bulk-arrival and bulk-service queue with variable server capacity. Stoch. Anal. Appl. 22(5), 1151–1173 (2004)
Singh, G., Gupta, U., Chaudhry, M.: Analysis of queueing-time distributions for M A P/D N /1 queue. Int. J. Comput. Math. 91(9), 1911–1930 (2014)
Acknowledgements
The authors would like to thank the referee for his valuable comments and suggestions which led to improvements in the paper. The second author acknowledges the Department of Science and Technology, Govt. of India, for the financial support under the project grant SR/S4/MS:789/12.
Author information
Authors and Affiliations
Corresponding author
Appendix When D(z)=0, the characteristic equation of P +(z), has repeated zeros inside the complex unit disk.
Appendix When D(z)=0, the characteristic equation of P +(z), has repeated zeros inside the complex unit disk.
Let us assume that the characteristic equation D(z)=0 has some multiple roots inside the closed complex unit disk. Already, we know that D(z)=0 has total B roots inside the unit disk. Let us call the multiple roots as α 1,α 2,…,α f with multiplicity r 1,r 2,…,r f so that \(m={\sum }_{i=1}^{f}r_{i}\). We call the other distinct roots as α m+1,α m+2,…,α B in |z|≤1 with α B =1. Analyticity of P +(z) in \(\{ z\in \mathbb {C}:~|z|\leq 1\}\) implies that
where f (i)(ζ) is the i th derivative of f(z) at z=ζ. This gives total B linearly independent simultaneous equations in B unknowns. Solving these we obtain \(p^{+}_{n}\)’s (0≤n≤B−1).
Rights and permissions
About this article
Cite this article
Pradhan, S., Gupta, U. & Samanta, S. Queue-length distribution of a batch service queue with random capacity and batch size dependent service: \(M/{G^{Y}_{r}}/1\) . OPSEARCH 53, 329–343 (2016). https://doi.org/10.1007/s12597-015-0231-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-015-0231-8