inria-00100895, version 1
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)
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
- a – INRIA - LIP
- 1:
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domain : Computer Science/Other
- Keywords : timed petri nets – optimal routing – scheduling – assignment || réseaux de petri temporisés – routage optimal – ordonnancement – affectation
- Internal note : A02-R-290 || alpan02a
- Comment : Colloque avec actes et comité de lecture. internationale.
- inria-00100895, version 1
- http://hal.inria.fr/inria-00100895
- oai:hal.inria.fr:inria-00100895
- From:
- Submitted on: Tuesday, 26 September 2006 14:52:46
- Updated on: Monday, 4 June 2007 09:36:50
Export