Shorter Queue Problem: A Numerical Study Using the Matrix-Geometric Solution

摘要

The author considers a service system with two similar servers in which a customer, on arrival, joins the shorter queue. The state of the system is described by a pari (i,j), j > or = i, where i and j are the number of customers in the shorter and the longer queue, respectively. The stationary probability vector and several performance characteristics are obtained using the matrix-geometric solution technique.