The Critical Path Method (CPM) in Project Management
According to the Project Management Institute (PMI), project management is the application of knowledge, skills, tools and techniques to project activities in order to meet project requirements and objectives.[1] The challenging task of managing projects can be supported by an operation reserach technique called the Critical Path Method (CPM). The CPM is a mathematically-network based algorithm in which can be used for planning, scheduling and monitoring project progress. [2]
The technique developed in late 1950s uses information from the work breakdowm structure (WBS) in a network representation to display interrelationships and dependencies between project activities that must be accomplished to complete a project. The technique is used for analyzing projects by determining the longest sequence of tasks through a project network, that is, the shortest possible time to complete the entire project and to identify which tasks should be concentrated on. [2][3][4]
The article includes brief introduction and background of the CPM method in project management will be introduced together with the methodology behind it. An example of the method is carried out step-by-step and a solution presented. Following is a discussion on time-cost trade offs in project acceleration together with an example of project crashing. Lastly, the article ends on a brief summary on the benefits and limitation of the CPM method.
Contents |
Overview
Introduction
hello
Background
Application and use
Methodology
The Project Network
Example
Consdideration of Time-Cost trade-offs
Once the critical path and timeing of activities has been identified - the next question is if it is possible to shorten the project in order to finish within a certein deadline.
Here is maybe possible to do an example of project crashing.
Benefits of CPM in project planning
Limitations of CPM
References
- ↑ Project Management Institute. (2008). A Guide to the Project Management Body of Knowledge. 4th Edition. p. 6. USA. ISBN 9781933890517
- ↑ 2.0 2.1 Larson, E. W & Gray, C. F. (2014). Project Management - The Managerial Process. 6th edition, p. 161. USA: NY. ISBN 9781259010705
- ↑ Newbold, R.C. (1998). Project Management in the Fast Lane – Applying the Theory of Constraint. USA: FL. ISBN 9781498738064
- ↑ Larsen, J. & Clausen, J., (2009). Course material in Networks and Integer Programming Supplementary at DTU - Notes to Networks and Integer Programming. Retrieved from campusnet.dtu.dk
