Pages that link to "Item:Q3683865"
From MaRDI portal
The following pages link to A Concept of Monotonicity and Its Characterization for Closed Queueing Networks (Q3683865):
Displaying 11 items.
- Capacity planning in manufacturing networks with discrete options (Q917425) (← links)
- A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results (Q1100815) (← links)
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues (Q1115029) (← links)
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs (Q1116554) (← links)
- Monotonicity properties of cost functions in queueing networks (Q1186501) (← links)
- Approximate uniformization for continuous-time Markov chains with an application to performability analysis (Q1190175) (← links)
- Monotonicity and asymptotic queue-length distribution in discrete-time networks (Q1598900) (← links)
- A queueing theoretical proof of increasing property of Polya frequency functions (Q1914308) (← links)
- Error bounds for state space truncation of finite Jackson networks (Q2462116) (← links)
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks (Q3986804) (← links)
- (Q5687690) (← links)