Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 31 (3) , 698-732
- https://doi.org/10.1137/0331032
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysisJournal of Optimization Theory and Applications, 1990
- Single Run Optimization of Discrete Event Simulations—An Empirical Study Using the M/M/l QueueIIE Transactions, 1989
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 QueueManagement Science, 1988
- Stopped Random WalksPublished by Springer Nature ,1988
- Regeneration and Networks of QueuesPublished by Springer Nature ,1987
- The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergenceStochastic Processes and their Applications, 1985
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithmsIEEE Transactions on Information Theory, 1984
- ProbabilityPublished by Springer Nature ,1984