Abstract
A simple queueing system was first introduced in Chapter 1 as an example of a DES. We have since repeatedly used it to illustrate many of the ideas and techniques discussed thus far. In this chapter, we will take a more in-depth look at queueing systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Selected References
Asmussen, S., Applied Probability and Queues, Wiley, New York, 1987.
Baskett, F., K. M. Chandy, R. R., Muntz, and R. R. Palacios, “Open, Closed, and Mixed Networks with Different Classes of Customers,” Journal of ACM, Vol. 22, No. 2, pp. 248–260, 1975.
Bremaud, P., Point Processes and Queues, Springer-Verlag, 1981.
Burke, P. J., “The Output of a Queueing System,” Operations Research, Vol. 4, pp. 699–704, 1956.
Buzen, J. P., “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Communications of ACM, Vol. 16, No. 9, pp. 527–531, 1973.
Gordon, W. J., and R. R. Newell, “Closed Queueing Systems with Exponential Servers,” Operations Research, Vol. 15, No. 2, pp. 254–265, 1967.
Jackson, J. R., “Jobshop-Like Queueing Systems,” Management Science, Vol. 10, No. 1, pp. 131–142, 1963.
Kleinrock, L., Queueing Systems, Volume I: Theory, Wiley, New York, 1975.
Lindley, D. V., “The Theory of Queues with a Single Server,” Proceedings of Cambridge Philosophical Society, Vol. 48, pp. 277–289, 1952.
Little, J. D. C., “A Proof of L =)W, ” Operations Research, Vol. 9, No. 3, pp. 383–387, 1961.
Reiser, M., and S. S. Lavenberg, “Mean-Value Analysis of Closed Multi-chain Queueing Networks,” Journal of ACM, Vol. 27, No. 2, pp. 313–322, 1980.
Snowdon, J. L., and J. C. Ammons, “A Survey of Queueing Network Packages for the Analysis of Manufacturing Systems,” Manufacturing Review, Vol. 1, No. 1, pp. 14–25, 1988.
Stidham, S., Jr., “A Last Word on L = ÀW, ” Operations Research, Vol. 22, pp. 417–421, 1974.
Trivedi, K.S., Probability and Statistics with Reliability, Queuing and Computer Science Applications, Prentice-Hall, Englewood Cliffs, 1982.
Walrand, J., An Introduction to Queueing Networks, Prentice-Hall, Englewood Cliffs, 1988.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cassandras, C.G., Lafortune, S. (1999). Introduction to Queueing Theory. In: Introduction to Discrete Event Systems. The Kluwer International Series on Discrete Event Dynamic Systems, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4070-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4070-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4072-1
Online ISBN: 978-1-4757-4070-7
eBook Packages: Springer Book Archive