Examples
Examples
Try the starting example
- Tickets: ID, arrival minute, service minutes, priority number ascending
- A,0,4,2 B,1,1,1 C,1,2,3
- Parallel agents, at most 20
- 1
- Start–finish by ticket (minutes)
- A: 0–4; B: 4–5; C: 5–7
- Wait by ticket (minutes)
- A: 0; B: 3; C: 4
- Mean ticket wait (minutes)
- 2.333333
- Maximum wait (minutes)
- 4
- Last completion time (minutes)
- 7
Try another scenario
- Tickets: ID, arrival minute, service minutes, priority number ascending
- A,0,4,2 B,1,1,1 C,1,2,3
- Parallel agents, at most 20
- 2
- Start–finish by ticket (minutes)
- A: 0–4; B: 1–2; C: 2–4
- Wait by ticket (minutes)
- A: 0; B: 0; C: 1
- Mean ticket wait (minutes)
- 0.333333
- Maximum wait (minutes)
- 1
- Last completion time (minutes)
- 4
Calculation method
Calculation method
Start–finish by ticket (minutes)
At each free-agent event start the available ticket with lowest priority number, then earliest arrival, then input order; agents tie by input index.
Wait by ticket (minutes)
Start−arrival. Service already running is never preempted.
Mean ticket wait (minutes)
Average waits over all supplied tickets.
Maximum wait (minutes)
Maximum recorded wait.
Last completion time (minutes)
Maximum service end timestamp.
Symbols and units
- a
- Tickets: ID, arrival minute, service minutes, priority number ascending
- b
- Parallel agents, at most 20
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- A deterministic nonpreemptive priority simulation with finite supplied jobs. It does not forecast arrivals, infer urgent cases or claim an optimal policy.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
MIT: multiserver queues and Erlang C ↗
Background reading; this does not imply endorsement or independent review of SumFizz.