Cycle time optimization for deterministic timed weighted marked graphs under infinite server semantics

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.