Perturbation analysis and optimization of queueing networks
From MaRDI portal
Publication:1170109
DOI10.1007/BF00933971zbMath0496.90034OpenAlexW1988288472MaRDI QIDQ1170109
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933971
perturbation analysisqueueing networksgradient optimizationdiscrete-event dynamic systemssensitivity informationtime-domain-based approach
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (63)
Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis ⋮ Infinitesimal perturbation analysis for second derivative estimation and design of manufacturing flow controllers ⋮ Convergence of perturbation analysis based optimization algorithm with fixed number of customers period ⋮ The score function approach for sensitivity analysis of computer simulation models ⋮ Genetic learning of dynamic scheduling within a simulation environment ⋮ Smoothed perturbation analysis derivative estimation for Markov chains ⋮ Perturbation analysis of the \(GI/GI/1\) queue ⋮ Quasi-Monte Carlo simulation for American option sensitivities ⋮ Infinitesimal perturbation analysis of birth and death process ⋮ Parallel sample path generation for discrete event systems and the traffic smoothing problem ⋮ Importance Sampling for Option Greeks with Discontinuous Payoffs ⋮ On queueing network models of flexible manufacturing systems ⋮ Generalized estimates for performance sensitivities of stochastic systems ⋮ Realization probability in multi-class closed queueing networks ⋮ Unnamed Item ⋮ Generalized sensitivity analysis of ergodic stochastic systems ⋮ System representations and performance sensitivity estimates of discrete event systems ⋮ American Option Sensitivities Estimation via a Generalized Infinitesimal Perturbation Analysis Approach ⋮ Sampling derivatives of probabilities ⋮ The convergence property of sample derivatives in closed Jackson queueing networks ⋮ Sensitivity analysis and the ``what if problem in simulation analysis ⋮ Uniformization and performance sensitivity estimation in closed queueing networks ⋮ Estimating Sensitivities of Portfolio Credit Risk Using Monte Carlo ⋮ Sensitivity estimates based on one realization of a stochastic system† ⋮ A Review of Modern Computational Algorithms for Bayesian Optimal Design ⋮ Gradient and Hessian of joint probability function with applications on chance-constrained programs ⋮ Copula sensitivity analysis for portfolio credit derivatives ⋮ Monte Carlo methods for sensitivity analysis of Poisson-driven stochastic systems, and applications ⋮ SENSITIVITY ANALYSIS OF NONLINEAR BEHAVIOR WITH DISTORTED PROBABILITY ⋮ Performance optimization of queueing systems with perturbation realization ⋮ Sample path and performance homogeneity of discrete event dynamic systems ⋮ On the consistency of second derivative perturbation analysis estimators for the M/G/1 queue ⋮ Stochastic design optimization of asynchronous flexible assembly systems ⋮ Control: a perspective ⋮ Implementation of sensitivity calculations on a Monte Carlo experiment ⋮ On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method ⋮ Parameterized Markov decision process and its application to service rate control ⋮ Full-state perturbation analysis of discrete event dynamic systems ⋮ Error analysis for regenerative queueing estimators with special reference to gradient estimators via likelihood ratio ⋮ A linear algebraic formulation of the performance sensitivities of queueing networks ⋮ Variance properties of sample path derivatives of parametric random variables ⋮ Bias properties of infinitesimal perturbation analysis for systems with parallel servers ⋮ Optimizing discrete event dynamic systems via the gradient surface method ⋮ Conditioning for variance reduction in estimating the sensitivity of simulations ⋮ Gradient estimates for the performance of Markov chains and discrete event processes ⋮ Basic ideas for event-based optimization of Markov systems ⋮ Optimization via simulation: A review ⋮ Quasi-Monte Carlo-based conditional pathwise method for option Greeks ⋮ How to optimize discrete-event systems from a single sample path by the score function method ⋮ An operational approach to perturbation analysis of closed queuing networks ⋮ Perturbation analysis of discrete event systems: Concepts, algorithms, and applications ⋮ Obtaining sample path derivatives by source code instrumentation ⋮ Perturbation analysis and Malliavin calculus ⋮ Sensitivity of sample values to parameter changes ⋮ Efficient Importance Sampling in Quasi-Monte Carlo Methods for Computational Finance ⋮ Stochastic dynamics simulation with generalized interval probability ⋮ On the perturbation analysis of discrete-event dynamic systems ⋮ Stationary IPA estimates for nonsmooth \(G/G/1/\infty\) functionals via Palm inversion and level-crossing analysis ⋮ Consistency of infinitesimal perturbation analysis for the GI/G/m queue ⋮ Efficient Bayesian Experimentation Using an Expected Information Gain Lower Bound ⋮ Sensitivity of sample values not generated by inversion ⋮ Monte Carlo Methods for Value-at-Risk and Conditional Value-at-Risk ⋮ Optimization algorithm with probabilistic estimation
Cites Work
This page was built for publication: Perturbation analysis and optimization of queueing networks
