Marking optimization of deterministic timed weighted marked graphs under infinite server semantics
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|