Firing rate optimization of cyclic timed event graphs by token allocations (Q5953543)

From MaRDI portal
scientific article; zbMATH DE number 1695134
Language Label Description Also known as
English
Firing rate optimization of cyclic timed event graphs by token allocations
scientific article; zbMATH DE number 1695134

    Statements

    Firing rate optimization of cyclic timed event graphs by token allocations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2003
    0 references
    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.
    0 references
    0 references
    token allocation
    0 references
    cyclic timed event graph
    0 references
    mixed integer linear programming
    0 references
    0 references