Abstract
In multi-class telecommunications or manufacturing systems, customers belonging to the same class can often be processed together. This results in a service capacity that depends on the classes of the customers in the queue. In this paper, we analyse a discrete-time batch-service queue with two customer classes. The single batch server can group all same-class customers at the head of the queue up to a constant class-dependent maximum service capacity. We focus on the analysis of the system occupancy at service initiation opportunities, and also compute both a light- and heavy traffic approximation in order to reduce the numerical complexity introduced by the maximum service capacities. Additionally, we propose a method for interpolating between these approximations in order to study the behaviour in the intermediate region. We also deduce the system occupancy and its approximations at random slot boundaries. In the numerical experiments, we examine the conditions under which these proposed approximations are accurate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adan, I., Leeuwaarden, J. V., & Winands, E. (2006). On the application of Rouché’s theorem in queueing theory. Operations Research Letters, 34(3), 355–360.
Arumuganathan, R., & Jeyakumar, S. (2005). Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times. Applied Mathematical Modelling, 29, 972–986.
Baetens, J., Claeys, D., Steyaert, B., & Bruneel, H. (2017). System performance of a variable-capacity batch-service queue with geometric service times and customer-based correlation. In 31st European conference on Modelling and Simulation.
Baetens, J., Steyaert, B., Claeys, D., & Bruneel, H. (2016). System occupancy of a two-class batch-service queue with class-dependent variable server capacity. In S. Wittevrongel & T. Phung-Duc (Eds.), Analytical and stochastic modelling techniques and applications (pp. 32–44). Switzerland: Springer
Baetens, J., Steyaert, B., Claeys, D., & Bruneel, H. (2018a). Delay analysis of a two-class batch-service queue with class-dependent variable server capacity. Mathematical Methods of Operations Research, 88, 1–21.
Baetens, J., Steyaert, B., Claeys, D., & Bruneel, H. (2018b). Delay analysis of a variable-capacity batch-server queue with general class-dependent service times. In AIP conference proceedings (Vol. 1978, p. 4). American Institute of Physics (AIP).
Banerjee, A., & Gupta, U. (2012). Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service. Performance Evaluation, 69(1), 53–70.
Banerjee, A., Gupta, U., & Chakravarthy, S. (2015). Analysis of a finite-buffer bulk-service queue under markovian arrival process with batch-size-dependent service. Computers and Operations Research, 60, 138–149.
Banerjee, A., Gupta, U., & Goswami, V. (2014). Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service. Computers and Industrial Engineering, 75, 121–128.
Bellalta, B., & Oliver, M. (2009). A space-time batch-service queueing model for multi-user MIMO communication systems. In Proceedings of the 12th ACM international conference on modeling, analysis and simulation of wireless and mobile systems (pp. 357–364). ACM.
Bountali, O., & Economou, A. (2017). Equilibrium threshold joining strategies in partially observable batch service queueing systems. Annals of Operations Research, 277, 1–23.
Boxma, O., van der Wal, J., & Yechiali, U. (2008). Polling with batch service. Stochastic Models, 24(4), 604–625.
Bruneel, H., & Kim, B. (1993). Discrete-time models for communication systems including ATM. Boston: Kluwer Academic.
Bruneel, H., Mélange, W., Steyaert, B., Claeys, D., & Walraevens, J. (2012). A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline. European Journal of Operational Research, 223(1), 123–132.
Chang, S., & Choi, D. (2005). Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations. Computers and Operations Research, 32(9), 2213–2234.
Chang, S., & Takine, T. (2005). Factorization and stochastic decomposition properties in bulk queues with generalized vacations. Queueing Systems, 50, 165–183.
Chaudhry, M., & Chang, S. (2004). Analysis of the discrete-time bulk-service queue \({G}eo/{G}^{Y}/1/{N+B}\). Operations Research Letters, 32(4), 355–363.
Chaudhry, M., & Templeton, J. G. (1983). A first course in bulk queues. New York: Wiley.
Claeys, D., Steyaert, B., Walraevens, J., Laevens, K., & Bruneel, H. (2012). Tail distribution of the delay in a general batch-service queueing model. Computers and Operations Research, 39, 2733–2741.
Claeys, D., Steyaert, B., Walraevens, J., Laevens, K., & Bruneel, H. (2013a). Analysis of a versatile batch-service queueing model with correlation in the arrival process. Performance Evaluation, 70(4), 300–316.
Claeys, D., Steyaert, B., Walraevens, J., Laevens, K., & Bruneel, H. (2013b). Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism. Computers and Operations Research, 40(5), 1497–1505.
Claeys, D., Walraevens, J., Laevens, K., & Bruneel, H. (2011). Analysis of threshold-based batch-service queueing systems with batch arrivals and general service times. Performance Evaluation, 68(6), 528–549.
Dorsman, J., der Mei, R. V., & Winands, E. (2012). Polling with batch service. OR Spectrum, 34, 743–761.
Germs, R., & Foreest, N. V. (2013). Analysis of finite-buffer state-dependent bulk queues. OR Spectrum, 35(3), 563–583.
Goswami, V., Mohanty, J., & Samanta, S. (2006). Discrete-time bulk-service queues with accessible and non-accessible batches. Applied Mathematics and Computation, 182, 898–906.
Janssen, A., & van Leeuwaarden, J. (2005). Analytic computation schemes for the discrete-time bulk service queue. Queueing Systems, 50, 141–163.
Niranjan, S., Chandrasekaran, V., & Indhira, K. (2017). State dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations and threshold. In IOP conference series: materials science and engineering (Vol. 263). IOP Publishing.
Pradhan, S., & Gupta, U. (2017). Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process. Annals of Operations Research, 277, 1–36.
Reiman, M. I., & Simon, B. (1988). An interpolation approximation for queueing systems with Poisson input. Operations Research, 36(3), 454–469.
Van Der Wal, J., & Yechiali, U. (2003). Dynamic visit-order rules for batch-service polling. Probability in the Engineering and Informational Sciences, 17(3), 351–367.
Vardakas, J. S., & Logothetis, M. D. (2009). Packet delay analysis for priority-based passive optical networks. In First international conference on emerging network intelligence (pp. 103–107).
Whitt, W. (1989). An interpolation approximation for the mean workload in a GI/G/1 queue. Operations Research, 37(6), 936–952.
Yi, X., Kim, N., Yoon, B., & Chae, K. (2007). Analysis of the queue-length distribution for the discrete-time batch-service \({G}eo/{G}^{a, Y}/1/{K}\) queue. European Journal of Operational Research, 181, 787–792.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Baetens, J., Steyaert, B., Claeys, D. et al. System occupancy in a multiclass batch-service queueing system with limited variable service capacity. Ann Oper Res 293, 3–26 (2020). https://doi.org/10.1007/s10479-019-03470-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-019-03470-1