Queue Wait Simulator
List when each customer arrives and how long their service takes, choose how many counters are open, and see what happens when everyone is served first come, first served. For each customer you get the counter, the start and end of service and the wait, then the mean and longest wait, how busy each counter was and when the last service ends. Add or remove a counter and compare. It is a deterministic what-if for planning a shop, a desk or a clinic, not a prediction of a real queue.
Separate values with spaces, commas or new lines, and use a dot for decimals. Up to 500 customers. Times are minutes counted from the same starting point.
The last service ends at (minutes)
5 min
Customer by customer
| Customer | Arrival | Service | Counter | Start | End | Wait |
|---|---|---|---|---|---|---|
| #1 | 0 | 5 | 1 | 0 | 5 | 0 |
| #2 | 0 | 2 | 2 | 0 | 2 | 0 |
| #3 | 0 | 3 | 2 | 2 | 5 | 2 |
Counter occupancy
| Counter | Customers | Busy (min) | Occupancy |
|---|---|---|---|
| 1 | 1 | 5 | 100% |
| 2 | 2 | 5 | 100% |
Occupancy is the busy time of a counter divided by the time from the first arrival to the last service end. First come, first served; a customer takes the counter that frees up earliest, the lowest number on a tie. Real queues have breaks, walk-aways and random service times that this simulation ignores.
How it works
- Type the arrival times in minutes, either one value for everybody (such as 0 when all are already waiting) or one value per customer.
- Type one service duration per customer, in minutes, in the same order.
- Set the number of counters, from 1 to 20, and read the table of waits and the counter occupancy.
- Change the number of counters to see how much each extra counter shortens the waits, then copy the table as CSV.
What people use it for
Staffing a service desk
See how the longest wait changes when you open a second or third counter for a busy half hour.
Checking a plan before opening day
Try the arrival times you expect for a launch, a market stall or a check-in, and see whether anyone waits too long.
Teaching how queues behave
Show students why one long service delays everyone behind it, and why several counters smooth it out.
Questions
- How does the simulator assign customers to counters?
- Customers are sorted by arrival time; if two arrive at the same minute they keep the order in which you typed their durations. Each customer in turn takes the counter that becomes free earliest, and the lowest counter number on a tie. Service starts at the later of the customer's arrival and the moment that counter is free, so the wait is the start minus the arrival.
- How is the occupancy of a counter defined?
- It is the total time the counter spent serving, divided by the time from the first arrival to the end of the last service, shown as a percentage. A counter that works the whole period shows 100 percent. Because customers go to the counter that is free earliest, the first counters tend to be busier than the last ones.
- What can it not tell me?
- Real queues have random arrivals and service times, customers who leave, breaks, priority lines and separate queues per counter. This tool replays exactly the numbers you type, once. For a long or random period, run several scenarios with different arrival lists and compare the longest waits rather than trusting a single run.
- What are the limits and the input format?
- Up to 500 customers and 20 counters. Separate values with spaces, commas, semicolons or new lines and use a dot for decimals, since a comma separates values here. Service durations must be above 0 and no value can be negative or above 100,000 minutes. If you give several arrival times, there must be one per service duration, otherwise the page tells you the two counts it found.