triz_queue
Compile a finite discrete queue from arrivals, service and storage capacity, schedule, and units, then check overflow across every declared arrival combination.
Instructions
Compile a finite discrete queue with explicit arrivals, service/storage capacity, schedule and units, then check overflow through existing dynamics. All declared arrival combinations within the schedule are considered.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| arrivals | Yes | Alternative arrival counts for EACH time slot; every combination is considered | |
| max_work | No | ||
| schedule | Yes | Specifies exactly when storage overflow is checked | |
| time_unit | Yes | Duration represented by one synchronous queue step, e.g. '1 ms' | |
| quantity_unit | Yes | Discrete conserved unit, e.g. requests or packets | |
| initial_backlog | Yes | ||
| service_capacity | Yes | Maximum units served per time slot | |
| storage_capacity | Yes |