Cyclic scheduling problems with assemblies: an approach based to the search of an initial marking in a marked graph

This paper deals with the scheduling of shared resources in cyclic problem. 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.