Infinitesimal perturbation analysis of discrete event dynamic systems: A general theory
- 1 January 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We give a rigorous extension of the perturbation analysis approach to more general Discrete Event Dynamic Systems (DEDS). For a fairly general class of DEDS, and for certain parameters and performance measures of such DEDS, an infinitesimal perturbation analysis algorithm is stated. It is then proved that this algorithm gives exact values for the gradients of performance w.r.t. the parameters, by observing only one sample-path of the DEDS. This enables very efficient calculation of these gradients: a fact that can be used for design/operation of manufacturing systems, communication networks, and many other real-world systems.Keywords
This publication has 20 references indexed in Scilit:
- Implementation of sensitivity calculations on a monte carlo experimentJournal of Optimization Theory and Applications, 1983
- Perturbation analysis and optimization of queueing networksJournal of Optimization Theory and Applications, 1983
- Infinitesimal and finite perturbation analysis for queueing networksAutomatica, 1983
- Robustness of queuing network formulasJournal of the ACM, 1983
- Heuristic methods based on mean-value analysis for flexible manufacturing systems performance evaluationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Parametric sensitivity of a statistical experimentIEEE Transactions on Automatic Control, 1979
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- Petri NetsACM Computing Surveys, 1977
- The production capacity of job shops with limited storage spaceInternational Journal of Production Research, 1976
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical ApproachOperations Research, 1967