Optimal routing in timed continuous Petri nets applied to scheduling/assignment problems
Gülgün Alpan, Bruno Gaujal · 2003
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.