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 firing rate of the net. We propose three different approaches. The first one is a ”greedy” incremental procedure that is computationally very efficient. The only drawback is that the convergence to the optimum is… (More)

In this paper we deal with the problem of modeling production systems where inventory management is predominant with respect to other aspects of the production cycle. The model we use, called First–Order Hybrid Petri Nets, is an hybrid model that combines fluid and discrete event dynamics and enables us to simulate the dynamic concurrent activities of… (More)

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 firing 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… (More)

In this paper we deal with the problem of allocating at least one place not shared among the other circuits. Kanban systems belong to this class. Then, we provide necessary and sufficient conditions 1 a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delays. We propose a new incremental… (More)