New linear program performance bounds for closed queueing networks
From MaRDI portal
Recommendations
- New linear program performance bounds for queueing networks
- scientific article; zbMATH DE number 1060034
- A linear programming problem in separable closed queueing networks
- Two classes of performance bounds for closed queueing networks
- scientific article; zbMATH DE number 870457
- Simple bounds for closed queueing networks
- Throughput bounds for closed queueing networks
- scientific article; zbMATH DE number 4079146
Cited in
(17)- On the guaranteed throughput and efficiency of closed re-entrant lines
- New linear program performance bounds for queueing networks
- Simple bounds for closed queueing networks
- Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
- Throughput bounds for closed queueing networks
- scientific article; zbMATH DE number 4079146 (Why is no real title available?)
- Two classes of performance bounds for closed queueing networks
- A linear programming problem in separable closed queueing networks
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Performance bounds for queueing networks and scheduling policies
- scientific article; zbMATH DE number 1060034 (Why is no real title available?)
- Performance bounds for queues via generating functions
- scientific article; zbMATH DE number 934471 (Why is no real title available?)
- Comparing LP Bounds for Queueing Networks
- QRF
- An improved balanced job bound analysis of closed queueing networks
This page was built for publication: New linear program performance bounds for closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954608)