Examples
Examples
Try the starting example
- JSON Arrivals [ID,arrival minute,service minutes]
- [["A",0,4],["B",1,4],["C",2,4]]
- Identical parallel servers or lanes (count)
- 2
- Service schedule
- [["A",1,0,4,0],["B",2,1,5,0],["C",1,4,8,2]]
- Maximum wait (minutes)
- 2
- Final clearance minute
- 8
Try another scenario
- JSON Arrivals [ID,arrival minute,service minutes]
- [["A",0,4],["B",1,4],["C",2,4]]
- Identical parallel servers or lanes (count)
- 1
- Service schedule
- [["A",1,0,4,0],["B",1,4,8,3],["C",1,8,12,6]]
- Maximum wait (minutes)
- 6
- Final clearance minute
- 12
Calculation method
Calculation method
Service schedule
Sort by arrival then ID; allocate each to earliest available server; return ID,server,start,end,wait.
Maximum wait (minutes)
Maximum service-start minus arrival.
Final clearance minute
Maximum service completion.
Symbols and units
- a
- JSON Arrivals [ID,arrival minute,service minutes]
- b
- Identical parallel servers or lanes (count)
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
- Gate scan-queue simulation for one preselected category-compatible gate pool. Assign gate/category eligibility before entry; identical pooled lanes use FCFS. No spectator safety or policing rule inferred. Supported limits: At most 500 arrivals and 100 identical servers. FCFS simulation without abandonment or random arrivals. Multiple stages require separate runs with previous-stage departures as next-stage arrivals.
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.