Optimal routing in timed continuous Petri nets applied to scheduling assignment problems

Gülgün Alpan (1) , Bruno Gaujal (1)

1 TRIO - Real time and interoperability

This paper deals with the resolution of scheduling and assignment problems modeled by deterministic timed continuous Petri nets (DTCPN). In particular, two dual problems will be discussed: Finding the optimal resource dispatching among users to satisfy a preset schedule and finding the optimal schedule subject to an assignment scheme. The computation of an optimum amount of resource is also discussed. A campus bus network system is taken as an example for illustration. || Dans cet article, nous étudions la résolution des problèmes d'ordonnancement et des problèmes d'affectation modélisés par les réseaux de Petri continus à temps discret. En particulier deux problèmes duaux sont considérés : Calcul de partage optimal des re

Mots clés: timed petri nets; optimal routing; scheduling; routage optimal; ordonnancement; affectation; assignment; réseaux de petri temporisés

Domaines: Autre [cs.OH]

Gülgün Alpan, Bruno Gaujal. Optimal routing in timed continuous Petri nets applied to scheduling assignment problems. IEEE International Conference on Systems, Man and Cybernetics 2002 - IEEE SMC 2002, 2002, Hammamet/Tunisia. ⟨inria-00100895⟩