Skip to main content
SpringerLink
Log in

A survey of queueing theory

  • Surveys
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper is intended to give a survey of the main results of queueing theory in China. It consists of five parts: (1) the transient behaviour of typical queueing systems; (2) classical problems; (3) approximation theory; (4) model structure; (5) applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N.T.J. Bailey, A continuous time treatment of a simple queue using generating functions, J. Roy. Statist. Soc. B 16(1954)288–291.

    Google Scholar 

  2. U.N. Bhat, Transient behavior of multiserver queues with recurrent input and exponential service times, J. Appl. Prob. 5(1965)158–168.

    Google Scholar 

  3. P. Billingsley,Probability and Measure (Wiley, New York, 1979).

    Google Scholar 

  4. J.H. Cao, Analysis of a machine service model with repairable service equipment, J. Math. Res. Exposition 5 (4) (1985)89–96, in Chinese.

    Google Scholar 

  5. J.H. Cao and J.Y. Yan, TheM/G/1 queueing system where the acceptance probabilities are dependent on the queue length, in:Symp. on Scientific Papers of the Chinese University of Science and Technology (1963), pp. 65–75, in Chinese.

  6. B.Q. Chen, On theM/G/1 queueing system in the case of batch arrival and batch service, Acta Sci. Natur. Univ. Nankai (1984) No. 2, 126–136, in Chinese.

    Google Scholar 

  7. B.Q. Chen, TheM/G/1 queue with controlled input, Appl. Math., J. Chin. Univ. 1 (2) (1986)1–14, in Chinese.

    Google Scholar 

  8. Y.Y. Chen, A variable-channel queueing model, Acta Univ. Lanzhou 20(1984)119–126, in Chinese.

    Google Scholar 

  9. K. Cheng and J.H. Cao, Analysis of theM/G/1 queueing system with repairable service station, Acta Math. Appl. Sinica 5(1982)113–127, in Chinese.

    Google Scholar 

  10. E. Çinlar, Queues with semi-Markovian arrivals, J. Appl. Prob. 4(1967)365–379.

    Google Scholar 

  11. J.W. Cohen,The Single-Server Queue (North-Holland, Amsterdam, 1969; revised ed. 1982).

    Google Scholar 

  12. B.W. Conolly, A difference equation technique applied to the simple queue with arbitrary arrival interval distribution, J. Roy. Statist. Soc. B20(1958)168–175.

    Google Scholar 

  13. B.W. Conolly, The busy period in relation to the queueing processGI/M/1, Biometrika 46(1959)246–251.

    Google Scholar 

  14. J.H.A. De Smit, On the many-server queue with exponential service times, Adv. Appl. Prob. 5(1973)170–182.

    Google Scholar 

  15. Z.Q. Dong and Z.L. Chen, Some mathematical problems in the design and management of a kind of data processor I, Acta Computer 3(1980)321–332, in Chinese.

    Google Scholar 

  16. Z.Q. Dong and Z.L. Chen, Some mathematical problems in the design and management of a kind of data processor II, Acta Computer 4(1981)28–38, in Chinese.

    Google Scholar 

  17. J.L. Doob,Stochastic Processes (Wiley, New York, 1953).

    Google Scholar 

  18. K.T. Fang, Z.Q. Dong and J.Y. Han, The structure of stationary streams without after-effects, Appl. Math. Comput. Math. 2(1965)84–90, in Chinese.

    Google Scholar 

  19. Group of Information Theory et al., Two queueing problems concerning the design of large computers, Fudan J. (Natur. Sci.) (1978) No. 3, 52–61, in Chinese.

    Google Scholar 

  20. J.Y. Han, A queueing model with queue length dependent arrivals, in:Symp. on Operations Research I (Science Press, Beijing, 1963), pp. 120–136, in Chinese.

    Google Scholar 

  21. J.Y. Han, The transient behaviour of a stochastic service system with queue length dependent arrivals and its optimization, Acta Math. Appl. Sinica 1(1978)59–72, in Chinese.

    Google Scholar 

  22. Q.M. He, Random walks and their application in queueing systems, Appl. Math., J. Chin. Univ. 3(1988)128–138, in Chinese.

    Google Scholar 

  23. Z.T. Hou, On a problem of Palm in the queueing processes, Scientia Sinica 12(1963)1106–1109.

    Google Scholar 

  24. G.H. Hsu, Waiting times in the queueing processGI/M/n with batch service, Acta Math. Sinica 14(1964)796–808, in Chinese.

    Google Scholar 

  25. G.H. Hsu, The transient behaviour of the queueing processGI/M/n, Acta Math. Sinica 15(1965)91–120, in Chinese; Chinese Math. 6(1965)393–421, in English.

    Google Scholar 

  26. G.H. Hsu, Thek-busy period of the stochastic service systemGI/M/n, Scientia Sinica 20(1977)411–420.

    Google Scholar 

  27. G.H. Hsu, The mean response times of the memory in complex computer systems, Acta Math. Appl. Sinica 1 (1978)137–144, in Chinese.

    Google Scholar 

  28. G.H. Hsu,Stochastic Service Systems (Science Press, Beijing, 1980; 2nd ed. 1988), in Chinese.

    Google Scholar 

  29. G.H. Hsu and Z.Q. Dong, The stochastic simulation of mining processes, Practice and Knowledge of Math. (1974), No. 4, 26–37, in Chinese.

    Google Scholar 

  30. G.H. Hsu and Q.M. He, The expectation of the first passage time forGI/M/1 type Markov processes, to be submitted.

  31. G.H. Hsu, Q.M. He, and X.S. Liu, The stationary behaviour of matched queueing systems, Acta Math. Appl. Sinica 13(1990)31–40, in Chinese.

    Google Scholar 

  32. G.H. Hsu, Q.M. He and X.S. Liu, Matched queueing systems with a double input,1 st Conf. of APORS, Seoul (1988); Acta Math. Appl. Sinica (English Series), to appear.

  33. G.H. Hsu and X.S. Liu, On some properties of Poisson processes, Acta Math. Appl. Sinica (English Series) 2(1985)45–53.

    Google Scholar 

  34. G.H. Hsu and X.S. Liu, Comparison and continuity of generalized standard systems, Chinese Ann. Math. 9A(1988)150–156, in Chinese; Chin. J. Contemporary Math. 9(1988)505–518, in English.

    Google Scholar 

  35. G.H. Hsu and J.Y. Yan, The first entrance times in stochastic service systems I, Acta Math. Appl. Sinica 3(1980)34–40, in Chinese.

    Google Scholar 

  36. G.H. Hsu and J.Y. Yan, The first entrance times in stochastic service systems II, Acta Math. Appl. Sinica 5(1982)25–35, in Chinese.

    Google Scholar 

  37. X. Jin, Theorems of Berry-Esseen type for many-server systems, Scientia Sinica 7(1988)673–687, in Chinese.

    Google Scholar 

  38. X. Jin, On the Berry-Esseen rate for the queue length of theGI/G/k system in heavy traffic. J. Appl. Prob. 25(1988)596–611.

    Google Scholar 

  39. X. Jin and R.X. Wang, On the Berry-Esseen rate for the waiting time of theGI/G/1 system in heavy traffic, Acta Math. Sinica 29(1986)651–657, in Chinese.

    Google Scholar 

  40. S. Karlin and J. McGregor, Many-server queueing process with Poisson input and exponential service times, Pacific J. Math. 8(1958)87–118.

    Google Scholar 

  41. D.P. Kennedy, Rates of convergence for queues in heavy traffic, I and II, Adv. Appl. Prob. 4(1972)357–391.

    Google Scholar 

  42. A. Ya. Khintchine,Mathematical Methods of the Theory of Mass Service, Trudy Math. Inst. im V.A. Steklova, Vol. 49 (1955), in Russian (English transl: Griffin, London, 1960).

  43. J.F.C. Kingman, On queues in heavy traffic, J. Roy. Statist. Soc. B 24(1962)383–392.

    Google Scholar 

  44. J. Köllerström, Heavy traffic theory for queues with several servers I, J. Appl. Prob. 11(1974)544–552.

    Google Scholar 

  45. X.S. Liu, Algorithms for feedback queueing systems, J. Graduate School, Univ. Sci. Tech. China 2(1985)119–132, in Chinese.

    Google Scholar 

  46. G.M. Luo, Some results forGI/G/k systems in heavy traffic, Math. Econ. 1(1984)153–168, in Chinese.

    Google Scholar 

  47. S.V. Nagaev, On the speed of convergence in a boundary problem, I and II, Theor. Prob. Appl. 15(1970)179–199; 419–441.

    Google Scholar 

  48. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  49. OR Division of the Inst. of Math. et al., Some mathematical problems in mining processes, Acta Math. Appl. Sinica 1(1978)266–269, in Chinese.

    Google Scholar 

  50. E. Parzen,Stochastic Processes (Holden-Day, San Francisco, 1962).

    Google Scholar 

  51. N.U. Prabhu,Queues and Inventories (Wiley, New York, 1965).

    Google Scholar 

  52. T.L. Saaty, Time-dependent solution of the many-server Poisson queue, Oper. Res. 8(1960)755–772.

    Google Scholar 

  53. S. Sawyer, Rates of convergence for some functionals in probability, Ann. Math. Statist. 43(1972)273–283.

    Google Scholar 

  54. G.J. Sun et al., General model of stochastic service systems for simulation and its applications, Acta Automatica Sinica 8(1982)145–153, in Chinese.

    Google Scholar 

  55. L. Takács, Transient behaviour of single-server queueing processes with recurrent input and exponential distributed service times, Oper. Res. 8(1960)231–245.

    Google Scholar 

  56. N.S. Tian, The structure of the binomial input, Acta Sci. Natur. Univ. Heilongjiang (1984), No. 2, 36–46, in Chinese.

    Google Scholar 

  57. N.S. Tian, The transient solution of theM/M/1 system, J. Oper. Res. 3 (2) (1984)73–74, in Chinese.

    Google Scholar 

  58. N.S. Tian, The stochastic service system with after-effect input, Acta Math. Appl. Sinica 9(1986)506–508, in Chinese.

    Google Scholar 

  59. R.X. Wang, Some results of transient behaviour for theSM/M/c queueing system, J. Eng. Math. 2(1985)51–61, in Chinese.

    Google Scholar 

  60. R.X. Wang and J. Ding, Limit theorems for queueing systems in heavy traffic with delayed feedback, Appl. Prob. Statist. (to appear), in Chinese.

  61. R.X. Wang and Y.J. Wu, Weak convergence limits for multi-server queues with priority: preemptiveresume discipline, J. Eng. Math. 3(1986)59–72, in Chinese.

    Google Scholar 

  62. R.X. Wang and Y.J. Wu, Weak convergence limits for queues with HL and PRE priority, Acta Math. Appl. Sinica (to appear), in Chinese.

  63. F. Wu, Some results about theGI/E k /1 queueing system, Acta Math. Sinica 10(1960)190–210, in Chinese.

    Google Scholar 

  64. F. Wu, On theGI/M/n queueing process, Acta Math. Sinica 11(1961)295–305, in Chinese.

    Google Scholar 

  65. L.D. Wu et al., Some discrete queueing systems, Fudan J. (Natur. Sci.) (1978) No. 2, 1–10, in Chinese.

    Google Scholar 

  66. X.Y. Yang and B.Q. Chen, An application of a simulation to the design of the loading system of a coal wharf in a seaport, Theory Practice Syst. Eng. (1984) No. 3, 41–47, in Chinese.

    Google Scholar 

  67. M.I. Yue, On the problemM/M/s in the theory of queues, Acta Math. Sinica 9(1959)494–502, in Chinese.

    Google Scholar 

  68. F.J. Zhang,GI/M/∞ queueing processes with batch arrivals, Acta Math. Appl. Sinica 2(1979)44–50, in Chinese.

    Google Scholar 

  69. H.Q. Zhang and R.X. Wang, Heavy traffic limit theorems for a queueing system in which customers join the shortest line, Adv. Appl. Prob. 21(1989)451–469.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, P.R. China

    Guang-Hui Hsu

Authors
  1. Guang-Hui Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsu, GH. A survey of queueing theory. Ann Oper Res 24, 29–43 (1990). https://doi.org/10.1007/BF02216814

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02216814

Keywords

Search

Navigation