A Tandem Queue with Coupled Processors: Computational Issues

In Resing and Örmeci 16] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first station according to a Poisson process and require service at both stations before leaving the system. The amount of work that a job requires at each of the stations is an independent, exponentially distributed random variable. When both stations are nonempty, the total service capacity is shared among the stations according to fixed proportions. When one of the stations becomes empty, the total service capacity is given to the nonempty station. We study the two-dimensional Markov process representing the numbers of jobs at the two stations. The problem of finding the generating function of the stationary distribution can be reduced to two different Riemann-Hilbert boundary value problems, where both problems yield a complete analytical solution. We discuss the similarities and differences between the two problems, and relate them to the computational aspects of obtaining performance measures.