Visitor desk wait-time calculator: how long visitors queue, and how many desks you need.
Enter how many visitors arrive in your busiest hour, how many minutes one check-in takes and how many desks or kiosks are open. The calculator shows how busy each desk is, how long the average visitor waits and the fewest desks that keep the wait under your target.
Desks busy on average: arrivals per hour × minutes per check-in ÷ 60. If this is 2, two desks are fully occupied on average through the peak.
Desk utilisation: the share of time each open desk spends checking someone in. At 100% or more the queue never clears during the peak.
Visitors who wait: the probability that a visitor finds every desk busy and has to stand in line.
Average wait in the queue: the average across all visitors, including the ones served at once.
Average time from arrival to pass: queue wait plus the check-in itself.
Desks needed: the smallest number of desks or kiosks whose average wait is at or under your target.
How it is calculated
The calculator treats the reception desk as an M/M/c queue: visitors arrive at random, check-in times vary around their average, every desk can serve any visitor, and visitors wait rather than leave. It is the same waiting-probability model (Erlang C) that is used to size call handling, applied here to people at a counter.
Offered load: A = arrivals per hour × minutes per check-in ÷ 60. If you counted the busiest 15 minutes, arrivals per hour = that count × 4.
Desk utilisation: ρ = A ÷ c, where c is the number of desks. The queue is stable only when ρ is below 1.
Probability of waiting: P(wait) = [Ac/c! × c/(c − A)] ÷ [Σk=0..c−1 Ak/k! + Ac/c! × c/(c − A)].
Average wait in the queue: Wq = P(wait) × minutes per check-in ÷ (c − A).
Desks needed: start at the first whole number above A and add one desk at a time until Wq is at or under your target.
The script computes P(wait) through the equivalent Erlang B recursion rather than raw factorials, so large numbers do not overflow; the result is the same.
Worked example (illustrative)
Suppose 30 visitors arrive in the busiest hour, each check-in takes 4 minutes, and 3 desks are open. The offered load is 30 × 4 ÷ 60 = 2 desks busy on average, so utilisation is 2 ÷ 3 = 67%. The probability of waiting works out to about 44%, and the average wait is 0.444 × 4 ÷ (3 − 2) ≈ 1.8 minutes. With only 2 desks, utilisation would be 100% and the queue would keep growing until arrivals slowed. The figures are illustrative; use counts from your own register or gate log.
Getting good inputs
Count the real peak. Shift change, morning contractor entry and the first hour after a meeting starts are usually the busiest; an all-day average hides the queue.
Time the whole check-in. Include ID check, photo, pass printing and any safety briefing done at the desk, not just typing the name.
Separate the streams. If contractors with a long induction and pre-approved guests share one line, try running the calculator for each and giving them separate desks.
Leave headroom. As utilisation climbs towards 100%, small bursts create long lines; the model assumes random arrivals, and real peaks can be lumpier, so treat the result as a floor.
Cutting the minutes per check-in
Adding desks is one lever; shortening each check-in is usually cheaper. Every minute removed from the average lowers the load on every desk at once. Pre-registering visitors, so the desk confirms details instead of typing them, and moving inductions out of the peak hour both reduce the check-in time you enter above.
How do I calculate visitor wait time at reception?
Work out the offered load (arrivals per hour × minutes per check-in ÷ 60), then use an M/M/c queueing formula with the number of desks to get the probability of waiting and the average wait. The calculator on this page does the arithmetic.
How many reception desks do I need for my visitors?
Enough that utilisation stays clearly below 100% in the busiest hour and the average wait meets your target. Enter your peak arrivals and check-in time, set a target wait, and the calculator returns the fewest desks that meet it.
How long should a visitor check-in take?
It depends on what the desk does: a pre-registered visitor with a QR can be confirmed quickly, while a walk-in needing ID capture, a printed pass and a safety briefing takes much longer. Time your own desk over a peak and use that average.
Why does the queue grow even though desks are not always busy?
Visitors do not arrive evenly. As utilisation approaches 100%, a short burst of arrivals builds a line that takes a long time to clear, so the average wait rises sharply even when desks are sometimes idle.