Marking optimization of deterministic timed weighted marked graphs

Timed marked graphs (TMGs), a special class of Petri nets, are used to model and analyze cyclic manufacturing systems. Weighted marked graphs (WMGs) are convenient to model systems with bulk services and arrivals. It is possible to apply analytical techniques for the marking optimization problem of such systems. The problem consists in minimizing the cost associated with an initial marking that ensures a given average cycle time. In this paper, we use simulation to compute the average cycle time and give a fast and effective heuristic solution.