A linear programming problem in separable closed queueing networks

DOI10.1109/9.21103MaRDI QIDQ3826347zbMATH OpenOpenAlexFDO

Authors A. Ridder

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.21103

zbMATH Keywords

optimal flow controlseparable closed queueing network

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Application models in control theory (93C95)

Recommendations

• New linear program performance bounds for closed queueing networks
• Linear programming model for the optimal control of a queueing network
• New linear program performance bounds for queueing networks
• scientific article; zbMATH DE number 1060034
• scientific article; zbMATH DE number 870457
• Mathematical programming models of closed tandem queueing networks
• A Fixed-Point Algorithm for Closed Queueing Networks
• Computational algorithms of optimization of closed queuing networks
• On a class of approximations for closed queueing networks

Cited in

(4)

• scientific article; zbMATH DE number 5116725 (Why is no real title available?)
• New linear program performance bounds for closed queueing networks
• Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
• Mathematical programming models for joint simulation-optimization applied to closed queueing networks

This page was built for publication: A linear programming problem in separable closed queueing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826347)