Examples
Examples
Try the starting example
- Wash arrivals JSON [vehicle ID,arrival elapsed minute,measured service minutes]
- [["A",0,20],["B",5,15],["C",10,20]]
- Identical wash bays (bays)
- 1
- Queue schedule [vehicle,bay,start,end,wait] (minutes)
- [["A",1,0,20,0],["B",1,20,35,15],["C",1,35,55,25]]
- Mean vehicle wait (min)
- 13.333333
- Maximum vehicle wait (min)
- 25
- Last completion minute
- 55
Try another scenario
- Wash arrivals JSON [vehicle ID,arrival elapsed minute,measured service minutes]
- [["A",0,20],["B",5,15],["C",10,20]]
- Identical wash bays (bays)
- 2
- Queue schedule [vehicle,bay,start,end,wait] (minutes)
- [["A",1,0,20,0],["B",2,5,20,0],["C",1,20,40,10]]
- Mean vehicle wait (min)
- 3.333333
- Maximum vehicle wait (min)
- 10
- Last completion minute
- 40
Calculation method
Calculation method
Queue schedule [vehicle,bay,start,end,wait] (minutes)
FCFS by arrival then ID; choose bay with earliest free time, tie bay index. Start=max(arrival,bayFree).
Mean vehicle wait (min)
Mean(start-arrival).
Maximum vehicle wait (min)
Max(start-arrival).
Last completion minute
Latest service end.
Symbols and units
- a
- Wash arrivals JSON [vehicle ID,arrival elapsed minute,measured service minutes]
- b
- Identical wash bays (bays)
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
- Deterministic nonpreemptive queue with identical bays and no breakdown/setup times. No steady-state queue distribution or throughput guarantee; input arrival trace defines workload. Supported limits: 1..1000 unique jobs; arrivals>=0; durations>0; bay count 1..100.
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.