A finite capacity queue with Markovian arrivals and two servers with group services (Q1331383)

The authors consider a finite capacity queueing system in which arrivals occur according to a Markovian arrival process. There are two servers who offer services to customers in groups of varying sizes and the service times are exponentially distributed with different parameters and they depend on the number of customers served. If the number of customers present exceeds a threshold value, the server initiates a new service to all the customers present; otherwise, he waits until the queue length reaches the threshold value. The authors perform a steady-state analysis of various system performance measures, and develop algorithms.