DocumentCode :
389528
Title :
Cyclic scheduling problems with assemblies: an approach based to the search of an initial marking in a marked graph
Author :
Trouillet, Benoit ; Benasser, Ahmer
Author_Institution :
LAIL, Ecole Centrale de Lille, Villeneuve d´´Ascq, France
Volume :
3
fYear :
2002
fDate :
6-9 Oct. 2002
Abstract :
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.
Keywords :
Petri nets; graph theory; resource allocation; scheduling; Petri net; Petri nets; cyclic problem; cyclic scheduling; dynamical discrete systems; marked graph; scheduling; shared resources; Assembly; Joining processes; Mathematical model; Petri nets; Plasma welding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems, Man and Cybernetics, 2002 IEEE International Conference on
ISSN :
1062-922X
Print_ISBN :
0-7803-7437-1
Type :
conf
DOI :
10.1109/ICSMC.2002.1176083
Filename :
1176083
Link To Document :
بازگشت