Abstract
Timed Petri nets are commonly used for modelling and analysis of automated manufacturing systems, including batch or high throughput systems. This paper consider the cycle optimization problem for a deterministic timed weighted marked graphs under infinite server semantics. The problem aims to find an initial marking to minimize the cycle time while the weighted sum of tokens in places is less than or equal to a desired value. We transform a timed weighted marked graph into several equivalent timed marked graphs and present a mixed integer linear programming method which can provide an optimal solution. Meanwhile, two suboptimal methods are proposed to reduce the computational cost.
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.
