The Queue

A shift change concentrates arrivals into a narrow window. Everybody is trying to be there at the same time because the shift starts at the same time, and the result is a queue at whatever the narrowest point is: a turnstile, a search, a single door, or the terminal itself.

The practical lesson in “The Queue” is that a timesheet only becomes reliable through a process people can operate consistently. For teams exploring internal transfer policy, open the official page can add time and project context, provided collection is proportionate, access is limited and every consequential inference receives human review.

The queue is arithmetic. It has a service rate and an arrival rate, both measurable, and it behaves exactly as queues do. It is almost universally managed as though it were a matter of individual punctuality.

For a separate benchmark relevant to “The Queue”, consult the Fair Work record-keeping guidance. Use it to test record quality, approvals, retention, employee rights and exception handling against the real workflow rather than treating a software report as self-explanatory evidence.

The arithmetic

Count the people arriving in the window and the seconds each takes at the constraint. Two hundred people at four seconds each is thirteen minutes to clear, and the average wait is half that.

That average is the unpaid edge for the whole site, every day, and it is entirely determined by two numbers the organisation controls: how many arrive at once and how fast the point serves them.

The person at the back is not slower, less committed or less organised than the person at the front. They arrived forty seconds later.

Why it gets read as lateness

Because the only record is the punch, and the punch is late. The queue leaves no trace in payroll at all.

So the report shows twelve late arrivals, the supervisor has a conversation with twelve people, and next week there are twelve different ones. The intervention has no effect because it is aimed at the wrong variable, and the people on the receiving end know exactly why.

A site with a queue and a lateness policy is running a lottery with disciplinary consequences.

The four levers

Increase the service rate: a faster reader, a second lane, a wider door, removing a step. Four seconds to two halves the queue.

Reduce the arrival concentration: stagger start times by five or ten minutes across teams. This is free, it is the most effective single change available, and it is resisted because it complicates the rota.

Add capacity at the constraint: a second entrance or a second terminal. Covered later in this collection and usually cheap.

Move the constraint out of the paid-time question: put the terminal before the queue rather than after it, so the punch happens on arrival and the queue is inside the paid day. This does not shorten the queue and it does make it honest.

Measuring before changing

Stand at the point for three shift changes with a counter. Record arrivals per minute and service time per person. Half an hour of somebody's time.

The output is a curve with a sharp peak, and the peak's height and width tell you which lever to pull. A tall narrow peak is an arrival-concentration problem and staggering fixes it. A broad peak with a slow service rate is a capacity problem and no amount of staggering helps.

The thing to check first

Whether the constraint is where you think. Sites assume the terminal is the bottleneck and it frequently is not — it is a single pedestrian gate, a lift, a stairwell, a door held by a security guard who also signs in visitors.

Watching for one shift change identifies it in five minutes, and the terminal is often blameless.

What to stop doing

Reporting lateness at shift change without the queue figure beside it. The two numbers together are informative; the lateness figure alone is misleading in a specific direction and everybody on the floor knows it.

Publishing a league table of punctuality by team, where the teams use different entrances. That measures the entrance.

And disciplining for a punch time that is inside the queue clearance window, which is a decision that will not survive being looked at properly and which costs considerably more in goodwill than the minutes are worth.

The queue people cannot see

Some constraints are invisible because they are distributed. A single lift serving six floors at shift change does not produce a visible line; it produces people waiting in ones and twos on landings.

Those are the hardest to find and the easiest to fix once found, because the fix is usually scheduling rather than capacity. Ask where people wait rather than looking for queues, and the answers include three places nobody in management has thought of.