Metra Potential Method - Revision history

Tkokotas at 15:13, 18 December 2018

2018-12-18T15:13:24Z

← Older revision		Revision as of 15:13, 18 December 2018
Line 1:		Line 1:
			''Developed by Augustin Louis Gabriel Bouet''


	The Metra Potential Method, or MPM, is a project management tool, invented in 1958 by French researcher Bernard Roy. <ref name="MPM1">[http://www.my-project-cafe.com/methode-potentiels-metra-mpm] JL. Brissard, M. Polizzi. 1999. ''Metra Potential Method'' </ref>, <ref name="MPM2">[http://www.logistiqueconseil.org/Articles/Logistique/Methode-potentiel-metra.htm] ''Logistique & Conseil, The Metra Potential Method'' </ref>, <ref name="MPM3">[http://www.prismconseil.fr/site/index.php/planification/La-methode-MPM.html] ''Planning tools and methods'' </ref> 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 .		The Metra Potential Method, or MPM, is a project management tool, invented in 1958 by French researcher Bernard Roy. <ref name="MPM1">[http://www.my-project-cafe.com/methode-potentiels-metra-mpm] JL. Brissard, M. Polizzi. 1999. ''Metra Potential Method'' </ref>, <ref name="MPM2">[http://www.logistiqueconseil.org/Articles/Logistique/Methode-potentiel-metra.htm] ''Logistique & Conseil, The Metra Potential Method'' </ref>, <ref name="MPM3">[http://www.prismconseil.fr/site/index.php/planification/La-methode-MPM.html] ''Planning tools and methods'' </ref> 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 .

AugustinB: /* Assigning the tasks duration in the MPM grid */

2015-09-27T18:17:02Z

Assigning the tasks duration in the MPM grid

← Older revision		Revision as of 18:17, 27 September 2015
Line 231:		Line 231:

	====Assigning the tasks duration in the MPM grid====		====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. <ref name="MPM3" />		Each stage is characterized by an earliest start and an 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. <ref name="MPM3" />

	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 ('''Table 4''').		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 ('''Table 4''').

AugustinB at 17:58, 27 September 2015

2015-09-27T17:58:17Z

← Older revision		Revision as of 17:58, 27 September 2015
Line 7:		Line 7:

	==Concept overview==		==Concept 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 <ref name="MPM1" />. It allows the user to prioritize a large number of tasks, taking into account the anteriority constraints linking these several tasks.		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 Chart]] and PERT representation <ref name="MPM1" />. 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.		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 aspects such as scheduling, deadlines or delays. 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.		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 aspects such as scheduling, deadlines or delays. 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.

AugustinB at 17:54, 27 September 2015

2015-09-27T17:54:59Z

← Older revision		Revision as of 17:54, 27 September 2015
Line 27:		Line 27:
	'''MPM grid:''' This is all of the tasks and stages that define the project. It highlights the relationships between tasks and stages. <ref name="MPM3" />		'''MPM grid:''' This is all of the tasks and stages that define the project. It highlights the relationships between tasks and stages. <ref name="MPM3" />

	'''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. <ref name="MPM7"> F. Laroche. 2012. ''Introduction to Project Management'' </ref>, <ref name="MPM3" />		'''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. <ref name="MPM7"> F. Laroche. 2012. ''Introduction to Project Management'' </ref>, <ref name="MPM3" />

	'''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. <ref name="MPM6">[http://cpa.enset-media.ac.ma/methode_mpm.htm] P. Célier. 2004. ''Metra Potential and Antecedent Method'' </ref> [[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]		'''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. <ref name="MPM6">[http://cpa.enset-media.ac.ma/methode_mpm.htm] P. Célier. 2004. ''Metra Potential and Antecedent Method'' </ref> [[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]
Line 398:		Line 398:
	By comparison to the PERT method, the MPM method has the advantage that its graphic representation doesn’t need to have recourse to fictive tasks, as it is sometimes needed for the implementation of the PERT method. <ref name="MPM3" />		By comparison to the PERT method, the MPM method has the advantage that its graphic representation doesn’t need to have recourse to fictive tasks, as it is sometimes needed for the implementation of the PERT method. <ref name="MPM3" />

	Although the PERT method was the first one imposed in project management, it appears that, from the 1980’s, the MPM method tends to supplant it. Indeed, this method is much more flexible and more easily adaptable to the automation of data processing, particularly when it deals with calculation algorithms and graphic representation. <ref name="MPM4" />		Although the PERT method was the first one imposed in project management, it appears that, from the 1980’s, the MPM method tends to supplant it. <ref name="MPM4" /> Indeed, this method is much more flexible and more easily adaptable to the automation of data processing, particularly when it deals with calculation algorithms and graphic representation. <ref name="MPM4" />

	==Limitations==		==Limitations==

AugustinB: /* Determination of tasks levels */

2015-09-24T15:13:49Z

Determination of tasks levels

← Older revision		Revision as of 15:13, 24 September 2015
Line 126:		Line 126:

	====Determination of tasks levels====		====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.		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. <ref name="MPM3" />

	The aim consists in identify the level of each tasks to obtain the global aspect of the MPM grid. To do so, a table may be created to identify which tasks don't have antecedent task for each level. The table below ('''Table 3''') illustrates the method in the example case.		The aim consists in identify the level of each tasks to obtain the global aspect of the MPM grid. To do so, a table may be created to identify which tasks don't have antecedent task for each level. The table below ('''Table 3''') illustrates the method in the example case.

AugustinB at 15:12, 24 September 2015

2015-09-24T15:12:28Z

← Older revision		Revision as of 15:12, 24 September 2015
Line 17:		Line 17:
	==Implementation of the method==		==Implementation of the method==
	===Terminology===		===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.		'''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. <ref name="MPM3" />, <ref name="MPM7" />

	'''Previous task:''' A task which, with respect to another, has to be performed before.		'''Previous task:''' A task which, with respect to another, has to be performed before. <ref name="MPM3" />

	'''Antecedent task:''' A task which is immediately prior to another task.		'''Antecedent task:''' A task which is immediately prior to another task. <ref name="MPM3" />

	'''Stage:''' A step is the beginning or the end of a task. It has no time nor cost.		'''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.		'''MPM grid:''' This is all of the tasks and stages that define the project. It highlights the relationships between tasks and stages. <ref name="MPM3" />

	'''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.		'''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. <ref name="MPM7"> F. Laroche. 2012. ''Introduction to Project Management'' </ref>, <ref name="MPM3" />

	'''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. <ref name="MPM6">[http://cpa.enset-media.ac.ma/methode_mpm.htm] P. Célier. 2004. ''Metra Potential and Antecedent Method'' </ref> [[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]		'''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. <ref name="MPM6">[http://cpa.enset-media.ac.ma/methode_mpm.htm] P. Célier. 2004. ''Metra Potential and Antecedent Method'' </ref> [[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]

	'''Earliest start:''' It corresponds to the earliest date when the task may start.		'''Earliest start:''' It corresponds to the earliest date when the task may start. <ref name="MPM7" />

	'''Latest start:''' It corresponds to the latest date when the task may start.		'''Latest start:''' It corresponds to the latest date when the task may start. <ref name="MPM7" />

	===Graphic representation===		===Graphic representation===

AugustinB: /* Critical path */

2015-09-24T15:04:32Z

Critical path

← Older revision		Revision as of 15:04, 24 September 2015
Line 376:		Line 376:

	====Critical path====		====Critical path====
	When observing a MPM grid from the starting task to the end task (Z), it appears that it is generally possible to take various paths to connect the beginning to the end. Each paths is represented by a succession of tasks (rectangles) and succession constraints (arrows). The successive realization of the various tasks constituting a path has a total duration, depending on the duration of each of these tasks. This total duration is called: '''path length'''.		When observing a MPM grid from the starting task to the end task (Z), it appears that it is generally possible to take various paths to connect the beginning to the end. Each paths is represented by a succession of tasks (rectangles) and succession constraints (arrows). The successive realization of the various tasks constituting a path has a total duration, depending on the duration of each of these tasks. This total duration is called: '''path length'''. <ref name="MPM6" />

	The minimum time to achieve a project corresponds to the length of the longest path. Indeed, the minimum duration of the project execution cannot be less than the sum of duration required to achieve the worst succession of asks in terms of time. This longest path is called '''critical path'''. <ref name="MPM3" />, <ref name="MPM6" />		The minimum time to achieve a project corresponds to the length of the longest path. Indeed, the minimum duration of the project execution cannot be less than the sum of duration required to achieve the worst succession of asks in terms of time. This longest path is called '''critical path'''. <ref name="MPM3" />, <ref name="MPM6" />

AugustinB at 15:02, 24 September 2015

2015-09-24T15:02:56Z

← Older revision		Revision as of 15:02, 24 September 2015
Line 29:		Line 29:
	'''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.		'''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.[[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]		'''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. <ref name="MPM6">[http://cpa.enset-media.ac.ma/methode_mpm.htm] P. Célier. 2004. ''Metra Potential and Antecedent Method'' </ref> [[File:Case1.PNG\|thumb\|128px\|'''Figure 1''', Task graphic representation]]

	'''Earliest start:''' It corresponds to the earliest date when the task may start.		'''Earliest start:''' It corresponds to the earliest date when the task may start.

AugustinB at 14:58, 24 September 2015

2015-09-24T14:58:09Z

AugustinB at 14:51, 24 September 2015

2015-09-24T14:51:37Z

← Older revision		Revision as of 14:51, 24 September 2015
Line 4:		Line 4:
	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. In 1958, he invented the Metra Potential Method (MPM, for Méthode des Potentiels Metra in French), a method based on the Graph Theory. <ref name="MPM1" />		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. In 1958, he invented the Metra Potential Method (MPM, for Méthode des Potentiels Metra in French), a method based on the Graph Theory. <ref name="MPM1" />

	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.		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. <ref name="MPM5">[http://excerpts.numilog.com/books/9782124651382.pdf] ''Evolutions of the PERTT Method'' </ref>

	==Concept overview==		==Concept overview==

← Older revision		Revision as of 14:58, 24 September 2015
Line 378:		Line 378:
	When observing a MPM grid from the starting task to the end task (Z), it appears that it is generally possible to take various paths to connect the beginning to the end. Each paths is represented by a succession of tasks (rectangles) and succession constraints (arrows). The successive realization of the various tasks constituting a path has a total duration, depending on the duration of each of these tasks. This total duration is called: '''path length'''.		When observing a MPM grid from the starting task to the end task (Z), it appears that it is generally possible to take various paths to connect the beginning to the end. Each paths is represented by a succession of tasks (rectangles) and succession constraints (arrows). The successive realization of the various tasks constituting a path has a total duration, depending on the duration of each of these tasks. This total duration is called: '''path length'''.

	The minimum time to achieve a project corresponds to the length of the longest path. Indeed, the minimum duration of the project execution cannot be less than the sum of duration required to achieve the worst succession of asks in terms of time. This longest path is called '''critical path'''.		The minimum time to achieve a project corresponds to the length of the longest path. Indeed, the minimum duration of the project execution cannot be less than the sum of duration required to achieve the worst succession of asks in terms of time. This longest path is called '''critical path'''. <ref name="MPM3" />, <ref name="MPM6" />

	Graphically, the '''critical path''' is the suite of tasks of the MPM which have a zero float (earliest start=latest start). The tasks of this path are called '''critical tasks'''. The sum of all the critical tasks duration indicates the minimum length of the project. Any delay in one of these tasks causes an equal delay to the end date of the project. Sometimes, there may be several critical paths, which have obviously the same length. In the figure below ('''Figure 7'''), the critical path is highlighted with the red cells and red arrows.		Graphically, the '''critical path''' is the suite of tasks of the MPM which have a zero float (earliest start=latest start). The tasks of this path are called '''critical tasks'''. The sum of all the critical tasks duration indicates the minimum length of the project. Any delay in one of these tasks causes an equal delay to the end date of the project. Sometimes, there may be several critical paths, which have obviously the same length. <ref name="MPM3" /> In the figure below ('''Figure 7'''), the critical path is highlighted with the red cells and red arrows.

	[[File:CriticalPath.PNG\|center\|thumb\|550px\|'''Figure 7''', Highlighting of the Critical Path]]		[[File:CriticalPath.PNG\|center\|thumb\|550px\|'''Figure 7''', Highlighting of the Critical Path]]

	====Floats====		====Floats====
	For the task which don’t have a zero float (earliest start<latest start), two floats may be defined.		For the task which don’t have a zero float (earliest start<latest start), two floats may be defined. <ref name="MPM6" />

	The '''free float''' is the maximum delay allowed to start a task without having an impact on the '''earliest starts''' of the following tasks.		The '''free float''' is the maximum delay allowed to start a task without having an impact on the '''earliest starts''' of the following tasks.
Line 391:		Line 391:
	The '''total float''' is the maximum delay allowed to start a task without having an impact on the latest starts of the following tasks.		The '''total float''' is the maximum delay allowed to start a task without having an impact on the latest starts of the following tasks.

	The task with a free and total float (tasks non critical) are interesting from the project management perspective because they can be used to smooth the resources and the costs of the project throughout its development.		The task with a free and total float (tasks non critical) are interesting from the project management perspective because they can be used to smooth the resources and the costs of the project throughout its development. <ref name="MPM3" />

	On the other hand, as said previously, on the critical path all floats worth zero. It results that the bigger the number of critical tasks is with respect to the total number of tasks, the lower is the elasticity of the project.		On the other hand, as said previously, on the critical path all floats worth zero. It results that the bigger the number of critical tasks is with respect to the total number of tasks, the lower is the elasticity of the project. <ref name="MPM6" />

	==Advantages==		==Advantages==
	By comparison to the PERT method, the MPM method has the advantage that its graphic representation doesn’t need to have recourse to fictive tasks, as it is sometimes needed for the implementation of the PERT method. <ref name="MPM3" />		By comparison to the PERT method, the MPM method has the advantage that its graphic representation doesn’t need to have recourse to fictive tasks, as it is sometimes needed for the implementation of the PERT method. <ref name="MPM3" />

	Although the PERT method was the first one imposed in project management, it appears that, from the 1980’s, the MPM method tends to supplant it. Indeed, this method is much more flexible and more easily adaptable to the automation of data processing, particularly when it deals with calculation algorithms and graphic representation.		Although the PERT method was the first one imposed in project management, it appears that, from the 1980’s, the MPM method tends to supplant it. Indeed, this method is much more flexible and more easily adaptable to the automation of data processing, particularly when it deals with calculation algorithms and graphic representation. <ref name="MPM4" />

	==Limitations==		==Limitations==