Incremental optimization of cyclic timed event graphs

Author

Giua, Alessandro ; Piccaluga, Aldo ; Seatzu, Carla

Author_Institution

Dept. of Electr. & Electron. Eng., Cagliari Univ., Italy

Volume

3

fYear

2000

fDate

2000

Firstpage

2211

Abstract

We deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delays. We propose an incremental algorithm that is inspired by the algorithm formulated by Panayiotou and Cassandras (1999) for the case of kanban systems. The algorithm can be applied to a special class of nets in which tokens are allocated to places that belong to only one circuit: this class is powerful enough to model kanban systems. We provide necessary and sufficient conditions for the convergence to the optimum also in the case of multiple solutions

Keywords

Petri nets; convergence; optimisation; production control; cyclic timed event graphs; deterministic transition firing delays; firing rate; incremental optimization; kanban systems; necessary and sufficient conditions; tokens allocation; Assembly systems; Circuits; Delay; Manufacturing systems; Petri nets; Power system modeling; Steady-state; Stochastic processes; Sufficient conditions; Virtual manufacturing;

fLanguage

English

Publisher

ieee

Conference_Titel

Robotics and Automation, 2000. Proceedings. ICRA '00. IEEE International Conference on

Conference_Location

San Francisco, CA

ISSN

1050-4729

Print_ISBN

0-7803-5886-4

Type

conf

DOI

10.1109/ROBOT.2000.846356

Filename

846356