Finite Arrival Queue Workbench

How to use Finite Arrival Queue Workbench

Schedule each arrival on the earliest available server, resolve ties explicitly and calculate exact wait, server workload and finite-horizon utilization.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Schedule each arrival on the earliest available server, resolve ties explicitly and calculate exact wait, server workload and finite-horizon utilization.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–300 distinct jobs and 1–20 servers. Nonnegative arrival and positive service durations are decimal strings no greater than 1 billion in one common time unit.
• All servers start idle at time zero. Equal arrivals keep input order; equal possible starts choose the lowest server number. No random arrivals, breaks, balking, priorities or stable-population prediction.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.