Cycle time optimization of deterministic timed weighted marked graphs

Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems such as robotic work cells or embedded systems. The main problem for designers is to find a trade off between minimizing the cost of the resources and maximizing the system´s throughput. It is possible to apply analytical techniques for the average cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the average cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value.