A new upper bound of cycle time in weighted marked graphs

We are interested in the performance evaluation of Generalized Timed Event Graphs (GTEG). This category of graphs presents a problem to compute the cycle time, in the case where their functioning is not with proper speed. For that, we propose an approach to find a new upper bound of Cycle Time. Finally, we apply our results to a real assembly line system.