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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
