Firing rate optimization of cyclic timed event graphs by token allocations (Q5953543): Difference between revisions

The authors consider the problem of allocating a given number of tokens in a cyclic timed event graph so as to maximize the firing rate of the net. They propose three different approaches. The first one is an efficient heuristic. The other two involve the solution of a mixed integer linear programming problem. A job-shop problem is used to demonstrate the applicability of the results.