1.Aleksandrov, A.M. (1974). A queueing system with repeated orders. Engineering Cybernetics Review 12(3): 1–4.
2.Alidrisi, M.M. (1990). Optimal control of the service rate of an exponential queueing network using Markov decision theory. International Journal of Systems Science 21(12): 2553–2563.
3.Allen, A. (1990). Probability, statistics, and queueing theory. New York: Academic Press.
4.Atkinson, K.E. (1989). An introduction to numerical analysis. New York: John Wiley & Sons.
5.Beyer, W. (ed.) (1987). CRC standard mathematical tables, 28th ed.Boca Raton, FL: CRC Press.
6.Choo, Q.H. & Conolly, B. (1979). New results in the theory of repeated orders queueing systems. Journal of Applied Probability 16: 631–640.
7.Cohen, J.W. (1957). Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommunications Review 18(2): 49–100.
8.Falin, G.I. (1976). Aggregate arrival of customers in one-line system with repeated calls. Ukrainian Mathematics Journal 28: 437–440.
9.Falin, G.I. (1990). A survey of retrial queues. Queueing Systems Theory and Applications 7: 127–168.
10.Fredericks, A.A. & Reisner, G.A. (1978). Approximations to stochastic service systems, with an application to a retrial model. The Bell System Technical Journal 58(3): 557–576.
11.Grabill, T., Gross, D., & Magazine, N. (1977). A classified bibliography of research on optimal design and control of queues. Operations Research 25: 219–232.
12.Greenberg, B. (1989). M/G/1 queueing systems with returning customers. Journal of Applied Probability 26: 152–163.
13.Keilson, J., Cozzolino, J., & Young, H. (1968). A service system with unfilled requests repeated. Operations Research 16: 1126–1137.
14.Kleinrock, L. (1975). Queueing systems, Vol. I. New York: John Wiley & Sons.
15.Kulkarni, V.G. & Choi, B.D. (1990). Retrial queues with server subject to breakdowns and repairs. Queueing Systems Theory and Applications 7: 191–208.
16.Le Gall, P. (1976). Trafics generaux de telecommunications sans attente. Commutation et Electronique 55: 5–24.
17.Little, J. (1961). A proof of the queueing formula L = λW. Operations Research 9(3): 383–387.
18.Lubacz, J. & Roberts, J. (1984). A new approach to the single server repeat attempt system with balking. In Proceedings from the Third International Seminar on Teletraffic Theory. Moscow pp. 290–293.
19.Mendelson, H. & Whang, S. (1990). Optimal incentive-compatible priority pricing for the M/M/1 queue. Operations Research 38(5): 870–883.
20.Press, W., Flannery, B., Teukolsky, S., & Vetterling, W. (1990). Numerical recipes in C. New York: Cambridge University Press.
21.Stroock, D.W. & Varadhan, S.R. (1979). Multidimensional diffusion processes. New York: Springer-Verlag.
22.Wilkinson, R.I. & Radnik, R.C. (1968). Customer retrials in toll circuit operation. 1968 IEEE International Conference on Communications, Philadelphia, PA.
23.Wolff, R. (1982). Poisson arrivals see time averages. Operations Research 30: 223–231.
24.Wolff, R. (1989). Stochastic modeling and the theory of queues. Englewood Cliffs, NJ: Prentice-Hall.