Abdel-Gawad, E.F. (1984). Optimal control of arrivals and routing in a network of queues. Ph.D. thesis, North Carolina State University, Raleigh.
Adan, I.J.B.F., Wessels, J., & Zijm, W.H.M. (1991). Analysis of the asymmetric shortest queue problem. Queueing Systems 8: 1–58.
Beutler, F.J. & Teneketzis, D. (1989). Routing in queueing networks under imperfect information: Stochastic dominance and thresholds. Stochastics and Stochastic Reports 26: 81–100.
Conolly, B.W. (1984). The autostrada queueing problem. Journal of Applied Probability 21: 394–403.
Davis, E. (1977). Optimal control of arrivals to a two-server queueing system with separate queues. Ph.D. thesis, North Carolina State University, Raleigh.
Ephremides, A., Varaiya, P., & Walrand, J. (1980). A simple dynamic routing problem. IEEE Transactions on Automatic Control 25: 690–693.
Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Transactions on Automatic Control 29: 491–499.
Halfin, S. (1985). The shortest queue problem. Journal of Applied Probability 22: 865–878.
Hariharan, R., Kulkarni, V.G., & Stidham, S. (1990). A survey of research relevant to virtual-circuit routing in telecommunication networks. Technical Report UNC/OR/TR 90−13, University of North Carolina at Chapel Hill.
Hariharan, R., Kulkarni, V.G., & Stidham, S. (1990). Optimal control of admission and routing to two parallel infinite-server queues. Proceedings of the 29th IEEE Conference on Decision and Control.
Hordijk, A. & Koole, G. (1990). Note on the optimality of the generalized shortest queue policy. Probability in the Engineering and Informational Sciences 4: 477–487.
Houck, D. J. (1987). Policies for routing customers to parallel queues. Operations Research 35: 306–310.
Johri, P.K. (1989). Optimality of the shortest line discipline with state-dependent service times. European Journal of Operations Research 41: 157–161.
Kulkarni, V.G. & Serin, Y. (1992). Optimal implementable policies: Discounted cost case. Operations Research (to appear).
Lehtonen, T. (1981). Stochastic comparisons for many server queues. Ph.D. thesis, Helsinki School of Economics.
Loeve, A. & Pols, M. (1990). Optimale toewijzing van klanten in wachtrijmodellen met twee bedieningscentra. Master's thesis, University of Leiden (in Dutch).
Menich, R. & Serfozo, R.F. (1991). Monotonicity and optimality of symmetric parallel processing systems. Queueing Systems 9: 403–418.
Towsley, D., Sparaggis, P.D., & Cassandras, C.G. (1992). Optimal routing and buffer allocation for a class of finite capacity queueing systems. IEEE Transactions on Automatic Control (to appear).
Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.
Weber, R.R. (1978). On the optimal assignment of customers to parallel queues. Journal of Applied Probability 15: 406–413.
Whitt, W. (1986). Deciding which queue to Join: Some counterexamples. Operations Research 34: 55–62.
Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14: 181–189.