Optimizing uniform non-Markov queueing networks
- 29 June 2010
- journal article
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 71 (6), 1158-1168
- https://doi.org/10.1134/s0005117910060172
Abstract
We propose a new efficient analytic-imitational method of optimizing non-Markov queueing networks. We estimate its convergence speed and precision with experiments and give practicai recommendations for its use.Keywords
This publication has 6 references indexed in Scilit:
- Nonlinear ProgrammingPublished by Wiley ,2005
- STATE‐OF‐THE‐ART SURVEY: OPEN QUEUEING NETWORKS: OPTIMIZATION AND PERFORMANCE EVALUATION MODELS FOR DISCRETE MANUFACTURING SYSTEMSProduction and Operations Management, 1996
- Infinitesimal Perturbation Analysis: A Tool for SimulationJournal of the Operational Research Society, 1989
- Sensitivity Analysis and Performance Extrapolation for Computer Simulation ModelsOperations Research, 1989
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 QueueManagement Science, 1988
- Regenerative Simulation of Response Times in Networks of QueuesPublished by Springer Science and Business Media LLC ,1980