Skip to Main content Skip to Navigation
Conference papers

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
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00100895
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:52:46 PM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM

Identifiers

  • HAL Id : inria-00100895, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

124