A semidefinite optimization approach to the steady-state analysis of queueing systems
From MaRDI portal
Recommendations
- Analysis of transient queues with semidefinite optimization
- Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks
- scientific article; zbMATH DE number 1054733
- A semigroup approach to queueing systems
- An optimization problem in queueing theory and a numerical solution method
- A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints
- The Use of Derivatives for Optimizing Steady State Queues
- Research and optimization of semi-Markov queueing models
Cites work
- A Conic Programming Approach to Generalized Tchebycheff Inequalities
- Applied Probability and Queues
- Bounds on measures satisfying moment conditions.
- Comparison methods for stochastic models and risks
- scientific article; zbMATH DE number 994723 (Why is no real title available?)
- scientific article; zbMATH DE number 3316606 (Why is no real title available?)
- scientific article; zbMATH DE number 3072483 (Why is no real title available?)
- Idle period approximations and bounds for the GI/G/1 queue
- Inequalities for moments of tails of random variables, with a queueing application
- Markov chains and invariant probabilities
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- On the Theory of Queues With Many Servers
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Persistence in discrete optimization under data uncertainty
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Some inequalities for the queue GI/G/1
- Stochastically recursive sequences and their generalizations
Cited in
(12)- Analysis of transient queues with semidefinite optimization
- Distributionally robust views on extremal queues
- Process flexibility: a distribution-free bound on the performance of k-chain
- On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems
- Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks
- Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
- Robust analysis in stochastic simulation: computation and performance guarantees
- Optimization-based calibration of simulation input models
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Research and optimization of semi-Markov queueing models
- Robust transient analysis of multi-server queueing systems and feed-forward networks
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
This page was built for publication: A semidefinite optimization approach to the steady-state analysis of queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641954)
