Simulation optimization for queues with heavy-tailed service times
From MaRDI portal
Cites work
- Applied Probability and Queues
- Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis
- Dynamic pricing under a general parametric choice model
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- General bounds and finite-time improvement for the Kiefer-Wolfowitz stochastic approximation algorithm
- Heavy-tail and voice over Internet protocol traffic: queueing analysis for performance evaluation
- Invariant measures for quasi-birth-and-death processes
- Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
- Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights
- Stationary waiting time derivatives
- Statistical Analysis of a Telephone Call Center
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State
- Stochastic Optimization by Simulation: Numerical Experiments with the M/M/1 Queue in Steady-State
- Stochastic simulation: Algorithms and analysis
- Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand
- The value of dynamic pricing in large queueing systems
- Transient Behavior of the M/G/1 Workload Process
This page was built for publication: Simulation optimization for queues with heavy-tailed service times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894825)
