ISSN:
1573-7594
Keywords:
Stochastic Timed Event Graphs
;
Discrete Event Dynamic Systems
;
Marking Optimization
;
Infinitesimal Perturbation Analysis
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract This paper addresses the marking optimization of stochastic timed event graphs, where the transition firing times are generated by random variables with general distributions. The marking optimization problem consists of obtaining a given cycle time while minimizing a p-invariant criterion. We propose two heuristic algorithms, both starting from the optimal solution to the associated deterministic problem and iteratively adding tokens to adequate places as long as the given cycle time is not obtained. Infinitesimal perturbation analysis of the average cycle time with respect to the transition firing times is used to identify the appropriate places in which new tokens are added at each iteration. Numerical results show that the heuristic algorithms provide solutions better than the ones obtained by the existing methods.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01797153
Permalink
