# Simulating a Multiple Server Queue

Initializing live version

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

In queuing theory, the simplest model is called the M/M/1 or M/M/c model (Markovian arrivals, Markovian service, and 1 or servers). Customers arrive at a facility and either get served immediately by a free server or join a queue that waits for a server to become available. Standard notation is:

[more]

= customer arrival rate in people per hour; it is assumed that the arrival times are a Poisson process, that is, the inter-arrival times follow an exponential distribution with mean ;

= rate at which a single server can serve customers, in number per hour; this follows an exponential distribution with mean ;

= number of servers.

In the Demonstration graphic, the number of people in the queue is indicated by the height of the red bars at the bottom; the horizontal green lines indicate customers being served; red lines indicate customers waiting. The table below the graphic shows the expected and observed values of several values associated with such a process. Note that the basic units are hours, but some of the parameters are given in minutes.

In order to look at a typical window of the queue situation, a certain percentage of the initial customers is ignored. This is controlled by the choice of the initial deletion ratio. If this is set to 0 then one sees a simulation that starts with the first customer that walks in the door. In that case, the number in the queue or the system will generally be less than the expected value, since the queue is smaller than the limiting value at the start. If the deletion ratio is set to, say, 0.5, then the graphic shown will start with the customer in the order where is the total number of customers. Regardless of deletions, the time starts at 0.

[less]

Contributed by: Karl W. Heiner (SUNY New Paltz) and Stan Wagon (Macalester College) (August 2011)
Open content licensed under CC BY-NC-SA

## Details

The first snapshot shows the situation starting from an empty queue (initial deletion ratio is 0) and with . In that case the queue builds up and then increases without bound. The last two snapshots use two servers, with and . The first 70% of the time interval is deleted, thus giving a more typical window on the queue formation process. Still there is a lot of variation in the size of the queue: in the first case the average number of people waiting is 0.57 while in the second it is 13. For more information, see [1] and [2].

References

[1] F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, 8th ed., New York: McGraw-Hill, 2004, pp. 765–774. [2] R. B. Chase, F. R. Jacobs, and N. J. Aquilano, Operations Management for Competitive Advantage, 10th ed., New York: McGraw-Hill, 2004.

## Permanent Citation

Karl W. Heiner (SUNY New Paltz) and Stan Wagon (Macalester College)

 Feedback (field required) Email (field required) Name Occupation Organization Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback. Send