An optimization problem in queueing theory and a numerical solution method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 20548
- Publication:3494356
- Numerical optimization of a queueing system by dynamic programming
- Optimization of queuing system via stochastic control
- Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
Cites work
Cited in
(11)- Numerical optimization of a queueing system by dynamic programming
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- Analysis of transient queues with semidefinite optimization
- Estimating the size of the calling population in finite-source election queues by bilinear programming techniques
- A semidefinite optimization approach to the steady-state analysis of queueing systems
- Approximate vs. exact algorithms to solve the maximum line length problem
- scientific article; zbMATH DE number 4167815 (Why is no real title available?)
- scientific article; zbMATH DE number 3956786 (Why is no real title available?)
- scientific article; zbMATH DE number 20548 (Why is no real title available?)
- Stochastic Optimization by Simulation: Numerical Experiments with the M/M/1 Queue in Steady-State
- Conjugate gradient method approach to queue theory
This page was built for publication: An optimization problem in queueing theory and a numerical solution method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007462)