Optimal token allocation in timed cyclic event graphs

Abstract In this paper we deal with the problem of allocating a given number of tokens in a cyclic timed event graph (CTEG) so as to maximize the fir-ing rate of the net. We propose two different procedures, both involving the solution of a mixed integer linear programming problem. The first one needs the knowledge of the elementary cycles, thus it is convenient only for those classes of CTEGs whose number of elementary cycles is limited by the number of places, like kanban systems. On the contrary, the second one enables us to overcome this difficulty, thus providing an efficient tool for the solution of allocation problems in complex manu-facturing systems like job–shop systems