1.1.5. Graphe PERT Brut

Figure 1.5. Graphe PERT
brut recensant toutes les activités et tâches du
projet
1.1.6. Matrice booléenne
La matrice booléenne permet d'ordonner facilement le
graphe PERT se rapportant à notre étude
1.1.6.1. Calcul des rangs
I
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
A
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
B
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
C
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
D
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
E
|
0
|
0
|
0
|
0
|
0
|
1
|
1
|
0
|
0
|
0
|
0
|
0
|
F
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
G
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
H
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
I
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
J
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
K
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
L
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
Tableau n° 1.2. : Calcul
des rangs
Le calcul des rangs nous permet de trouver la disposition
à laquelle sera ordonné notre graphe, ainsi nous posons :
a. Disposition du graphe
n = 10(Rn-10)
|
= A
|
R0
|
(Rn-9)
|
= B
|
R1
|
(Rn-8)
|
= C
|
R2
|
(Rn-7)
|
= D
|
R3
|
(Rn-6)
|
= E
|
R4
|
(Rn-5)
|
= F
|
R5
|
(Rn-4)
|
= G
|
R6
|
(Rn-3)
|
= H
|
R7
|
(Rn-2)
|
= I
|
R8
|
(Rn-1)
|
= J
|
R9
|
Tableau n° 1.3. :
Disposition du graphe
D'où nous avons :
R9 = {10}
R8 = {9}
R7 = {8}
R6 = {7}
R5 = {6}
R4 = {5}
R3 = {4}
R2 = {3}
R1 = {2}
R0 = {1}
|