In this example a FIFO Queue is used to accept incoming phone calls from (randomly generated) customers. The calls are placed in the queue in the order they arrive (with a timestamp for observation.) The queue is then serviced by one of three operators who take different times to deal with each call (Sam Slow takes 8 seconds, Mollie Medium takes 5 seconds and Fred Fast takes 3 seconds)
| Sam Slow = 8 secs | Mollie Medium = 5 secs | Fred Fast = 3 secs |
|---|---|---|
|
|
|
| No call data | No call data | No call data |
| Approximate time between calls: | ||