Metra Potential Method
(→Adding the Earliest Start to the MPM grid) |
|||
| Line 229: | Line 229: | ||
These information allows to fill the cells dedicated to the Earliest Starts in the MPM grid, as illustrated below. | These information allows to fill the cells dedicated to the Earliest Starts in the MPM grid, as illustrated below. | ||
| + | |||
| + | [[File:MPM, step 3.PNG|center|thumb|800px|Figure 5, MPM grid with Earliest Starts]] | ||
====Adding the Latest Start to the MPM grid==== | ====Adding the Latest Start to the MPM grid==== | ||
Revision as of 20:46, 21 September 2015
The Potential Metra Method, or MPM, is a project management tool, invented in 1958 by French researcher Bernard Roy. MPM is used to describe, organize and plan the several tasks constituting a project development. This management method is similar to the PERT method. It consists of an oriented graph, whose summits represent tasks and the connections represent anteriority constraints. Thanks to the use of the MPM method, a critical path is identified easily by simply reading the chart, and the length of the critical path is represented directly.
Contents |
History
Invented in 1958 by French researcher Bernard Roy, the Potential Metra Method (MPM, for Méthode des Potentiels Metra in French) is based on the Graph Theory. This method was first created as a tool provided for a crank shafts factory called Mavilor. Very soon after its creation, MPM was used for the construction of the superstructures of cruise liner France. In the beginning of the 1960’s, this method was involved in the development of the airplane program Concorde, as well as in the construction of the first generation of nuclear plants in France.
Bernard Roy is a French researcher born in 1934, widely recognized as a pioneer in the field of operational research in France. His works form one of the foundations of scientific approaches to decision support.
Overview
Created the same year as the PERT method, the MPM method is a system of representation and optimization of project tasks. This method can be considered to be half-way between Gantt Graph and PERT representation. It allows the user to prioritize a large number of tasks, taking into account the anteriority constraints linking these several tasks.
The main goal leading to the creation of this new management method was to reduce the complexity of the Gantt chart, taking into account the dependency relationships between multiple tasks (precedence, inheritance, etc.) and also the evolution of these constraints along the time.
Similarly to the PERT method, the main benefit of MPM is to reduce the time required to achieve a project, but this method only takes into account the schedule aspects, deadlines, delays, etc… It cannot be used in the field of budget or resources management. By precisely describing the dependency between each task, MPM optimizes speediness of the process providing a graphical representation under the form of a network. Thus, all information related to a same operation are grouped under a single node, which facilitates the identification of the critical path.
Allowing an easy identification of the critical path, the MPM is used to determine the minimum time required to conduct a project. Moreover, this method affords to define the dates on which the various tasks involved in the project may or must begin to ensure that this minimum time is respected.
Implementation of the method
Terminology
Task: In the frame of project management, a task is the basic division of the work required to produce the result. The task evolves from an initial state to a final state. Each task has a duration and cost.
Previous task: A task which, with respect to another, has to be performed before.
Antecedent task: A task which is immediately prior to another task.
Stage: A step is the beginning or the end of a task. It has no time nor cost.
MPM grid: This is all of the tasks and stages that define the project. It highlights the relationships between tasks and stages.
Critical path: The longest possible continuous path from the initial task starting to the terminal task ending; it determines the total amount of time required for the project delivery. Any time delays along this path will delay the execution of the project by at least the same amount.
Float (or slack): A float is a measure of the available extra time and resources needed to complete a task. It indicates the possible delay that an individual task may have without delaying the all process.
Earliest start: It corresponds to the earliest date when the task may start.
Latest start: It corresponds to the latest date when the task may start.
Graphic representation
Task: A task is represented by a frame and is identified by its name. The earliest start and latest start corresponding to the task are listed in the top of the frame.
Succession constraint: Succession constraints are represented by an arrow which goes from the antecedent task to the next one. The constraint duration corresponds to the starting task duration. This values is written above the arrow.
Convention rules
Three main rules apply when organizing the tasks network in the frame of MPM method:
- Any stage has an origin stage as beginning, and an end stage as end.
- A stage can be achieved only when all the tasks that precede it are finished.
- No task can be performed if the original stage has not been reached.
- By convention, a MPM network must be terminated with a single task (called Z generally) that determines the end of the project. This task will have no duration.
| Task | Previous tasks |
|---|---|
| A | - |
| B | A |
| C | A |
| D | - |
| E | AB |
| F | ACD |
| Z | ABCDEF |
Implementation of the methodology
List of tasks
Achieving a graph showing the analysis of a scheduling problem requires a preliminary study of the various tasks to be considered, their duration, and the relationships between tasks (mainly constraints of anteriority and antecedence). A special attention should be paid when it comes to achieve this preliminary study.
| Task | Antecedent tasks |
|---|---|
| A | - |
| B | A |
| C | A |
| D | - |
| E | B |
| F | CD |
| Z | EF |
An efficient way to list these tasks consists in realizing a table as illustrated on the right table. A first approach is made by integrating as much as previous tasks as possible.
Then, in order to ease the work, only the antecedent tasks will be kept. In the example case, task A is not directly prior to tasks E or F. As task A cannot be represented more than once in the MPM grid, it is useless to keep it on the table. This way, it is possible to obtain the table on the left.
Determination of tasks levels
In order to clearly establish the MPM grid, it is appropriate to define an achievement level for each task. Such a level is a moment in time. The higher the level is, the faster the task is from the first stage of the project.
The aim consist in identify the level of each tasks to obtain the global aspect of the MPM grid. To do so, a table may be realized to identify which tasks don’t have antecedent task for each level. The table below illustrates the method in the example case.
//TABLE TO ADD THERE
Create this table allows to plot the global layout of the MPM grid, as illustrated below in the case of the example.
| Task | Task duration |
|---|---|
| A | 3 |
| B | 7 |
| C | 6 |
| D | 11 |
| E | 8 |
| F | 5 |
| Z | 0 (End task, no duration |
Assigning the tasks duration in the MPM grid
Each stage is characterized by an earliest start and a earliest finish. These specific dates are defined according to of the duration of tasks. The method to calculate the duration of tasks is not specified in this article. Briefly, this duration depends on the workload needed and the number of resources available to achieve the task.
In the example developed as an illustration for the MPM implementation, it is considered that the task duration were already set, as illustrated in the table on the left.
These information allows to fill partially the MPM grid, as illustrated below.
Adding the Earliest Start to the MPM grid
The initial stage of the project starts on day 0. From this point that we begin to accumulate the duration of each task to set the earliest starts of the following tasks. The calculation of each earliest start may be performed using a table, as illustrated in the table below for the example.
| Task | Task duration | Antecedent tasks | Calculation of earliest start | Earliest Start |
|---|---|---|---|---|
| A | 3 | - | 0 (level 0) | 0 |
| B | 7 | A | 0+3=3 | 3 |
| C | 6 | A | 0+3=3 | 3 |
| D | 11 | - | 0 (level 0) | 0 |
| E | 8 | B | 3+7=10 | 10 |
| F | 5 | CD | 3+6=9 or 0+11=11 | 11 |
| Z | 0 | EF | 10+8=18 or 11+5=16 | 18 |
When a task is conditioned by more than one single antecedent task, the higher sum is kept as earliest start. Thus, in the example, F is conditioned by the execution of both tasks C and D, the earliest start for task F is set to be 11 days, corresponding to the minimum time needed to achieve D, higher than the minimum time to achieve C.
These information allows to fill the cells dedicated to the Earliest Starts in the MPM grid, as illustrated below.
