Introduction to Queueing Theory
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.
KeywordsExpense Eter Convolution Lost Exter
Unable to display preview. Download preview PDF.
- Bremaud, P., Point Processes and Queues, Springer-Verlag, 1981.Google Scholar
- Kleinrock, L., Queueing Systems, Volume I: Theory, Wiley, New York, 1975.Google Scholar
- 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.Google Scholar
- Trivedi, K.S., Probability and Statistics with Reliability, Queuing and Computer Science Applications, Prentice-Hall, Englewood Cliffs, 1982.Google Scholar