MPM method
The MPM method makes it possible to evaluate the duration of completion of a complex project and to detect the parts of this project that do not support any delay. Task information is summarized in a schedule.
Unlike the PERT method, the vertices of the BPM method are tasks to be performed. We can “consider” that the edges of the PERT method become vertices in the MPM method (similarly for the vertices becoming edges).
The main differences with the PERT method:
- the representation of the anteriority relations of a task sharing with another some of its antecedents does not require the use of fictitious links
- to each arc is associated a numerical value which represents either an operation duration or a delay.
the graph MPM is built like the PERT graph, the margin calculation is identical. Here is the timeline:
|
task
|
precedence
|
duration
|
|
TO
|
–
|
5
|
|
B
|
–
|
5
|
|
VS
|
B
|
3
|
|
D
|
A, C
|
10
|
|
E
|
–
|
5
|
|
F
|
–
|
0.5
|
|
G
|
D
|
0.5
|
| H | F, G |
0.5
|
|
I
|
H
|
1
|
|
J
|
E, I
|
2
|
Which gives the following graph:
