Marking optimization of deterministic timed weighted marked graphs under infinite server semantics

Zhou He (1) , Zhiwu Li (2) , Isabel Demongodin (1, 3) , Alessandro Giua (4)

1 LSIS - Laboratoire des Sciences de l'Information et des Systèmes
2 Xidian University
3 MOFED - Modèles et Formalismes à Evénements Discrets
4 UniCa - Università degli Studi di Cagliari = University of Cagliari

For modelling and analysis of automated production systems as batch or high throughput systems, timed Petri nets are commonly used. In this paper, we deal with the marking optimization problem of a timed weighted marked graphs under infinite server semantics. The problem consists in finding an initial marking to minimize the weighted sum of tokens in places while the average cycle time is less than or equal to a given value. We propose two different heuristic approaches to solve the optimization problem.

Domaines: Informatique [cs]; Automatique

Zhou He, Zhiwu Li, Isabel Demongodin, Alessandro Giua. Marking optimization of deterministic timed weighted marked graphs under infinite server semantics. 3rd International Conference on Control, Decision and Information Technologies (CoDIT'16), 2016, Malte, Malta. ⟨hal-01490127⟩