Cyclic scheduling problems with assemblies: an approach based to the search of an initial.

For the most recent entries see the Petri Nets Newsletter.

Cyclic scheduling problems with assemblies: an approach based to the search of an initial.

In: Proceedings of the second IEEE International Conference on Systems, Man and Cybernetics (SMC'02), October 6-9, 2002, Hammamet, Tunisia, Volume 3. IEEE Computer Society Press, October 2002.

Abstract: This paper deals with the scheduling of shared resources in cyclic problems. This scheduling problem is solved by transforming a Petri net with conflicts into a marked graph. Then the marked graph can be analysed thanks to the (min,+) dioid.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography