1. K. L. Chung, Markov Chains with Stationary Transition Probabilities, Springer-Verlag, New York, 1967.
2. A. Cobham, “Priority Assignment in Waiting Line Problems,” Oper. Res., 2, (1954), 70–76.
3. D. P. Heyman, “Problem: An M/M/c Queue with Priorities,” Newsletter, Applied Probability Technical Section/College, O.R.S.A./T.I.M.S., Fall, 1977.
4. D. M. Lucantoni and M. F. Neuts, “Numerical Methods for a Class of Markov Chains Arising in Queueing Theory,” Technical Report No. 78/10, Department of Statistics and Computer Science, University of Delaware.
5. D. R. Miller, “Computation of Steady-State Probabilities for M/M/1 Priority Queues,” Oper. Res., 29, (1981), 945–958.