Pages that link to "Item:Q1116554"
From MaRDI portal
The following pages link to Monotonicity of the throughput of a closed exponential queueing network in the number of jobs (Q1116554):
Displaying 15 items.
- Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates (Q931401) (← links)
- Some properties of the throughput function of closed networks of queues (Q1060944) (← links)
- A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results (Q1100815) (← links)
- On the guaranteed throughput and efficiency of closed re-entrant lines (Q1127038) (← links)
- Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes (Q1177484) (← links)
- The M/M/c with critical jobs (Q1298763) (← links)
- Upper and lower bounds for the waiting time in the symmetric shortest queue system (Q1315342) (← links)
- A queueing theoretical proof of increasing property of Polya frequency functions (Q1914308) (← links)
- Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems (Q2152014) (← links)
- Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs (Q3472957) (← links)
- A Concept of Monotonicity and Its Characterization for Closed Queueing Networks (Q3683865) (← links)
- Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks (Q3798010) (← links)
- Second-Order Properties of the Throughput of a Closed Queueing Network (Q3800860) (← links)
- Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates (Q4431307) (← links)
- On queueing-inventory-location problems (Q6188797) (← links)
