Abstract
A queueing system consists of items arriving according to some form of arrival distribution to be served by one or more servers. The length of time taken to serve customers is described by one or more given service distributions. The queue discipline determines the way in which customers move through the system, the simplest being a first come first served system. Knowledge of these three things is sufficient to permit modelling of the system mathematically or simulating it on a computer.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1987 E. J. Redfern
About this chapter
Cite this chapter
Redfern, E.J. (1987). Simulating Queues. In: Introduction to Pascal for Computational Mathematics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18977-9_18
Download citation
DOI: https://doi.org/10.1007/978-1-349-18977-9_18
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-44431-3
Online ISBN: 978-1-349-18977-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)