CPM Project Management Method PDF

 Problem Modelin g Analysis Resource Time Cos s t PER CP T M  HISTORICAL BACKGROUND OF CPM The Critical Path Method (CPM) was d...

 Problem Modelin g Analysis Resource Time Cos s t PER CP T M  HISTORICAL BACKGROUND OF CPM The Critical Path Method (CPM) was developed in the late 1950s. It was developed by Morgan, Walker, and Kelley at Dupont Company in Detroit. The primary purpose of CPM was to analyze and plan large projects. The first report was published in 1957 in the book “Planning and Scheduling of Research and Development Projects”. CPM was initially used in the automotive industry to identify critical paths. Since then, CPM has spread and been widely used across various industries and sectors.  Definition of CPM CPM is a method for analyzing and planning projects. It is used to identify critical paths and estimate early and late timings. It helps analyze the sequence of activities and prioritize high-priority tasks. It relies on graphical representation to depict the sequence of activities and their relationships. It assists in estimating the duration required to complete the project and identifying the critical path that affects the project’s overall duration. It is considered a fundamental tool in project management for setting work priorities and allocating resources.  Stages of completing the CPM  The CPM is calculated in two stages Forward Pass Erly times types Calculating early times 2. Backward Pass Late times types Calculating late times  Forward Pass The Forward Pass calculates the earliest start (ES) and earliest finish (EF) times for each activity. It begins with the project’s start date and moves forward through the network diagram, considering activity durations and dependencies.  Early Times types 1. Early Start (ES): The earliest possible start time for an activity, determined by the earliest finish time of its preceding activities. 2. Early Finish (EF): The earliest possible finish time for an activity, calculated based on its early start time and duration.  Calculating early times 1. Initial Activity Case: Early Start (ES) is equal to the initial time (0). Early Finish (EF) is calculated using the equation: EF = ES + Duration. 2. Predecessor Activity Case: Early Start (ES) is equal to the maximum of the early finish times of all preceding activities. Early Finish (EF) is calculated using the equation: EF = Maximum of Early Finish Times of predecessor Activities. 3. Calculation Method: Begin with identifying the initial activity. For each subsequent activity, calculate the early start and early finish using the equations mentioned above. Determine the early start and early finish for all activities sequentially to reach the endpoint.  Early Time Equations 1. If the activity is related to more than one activity J A B C  = max ( + Daj, + Dbj, + Dcj ) A A Daj J Db B B Dj c j J C C 2. If the activity is related to only one avtivity J A Daj  = + Daj A A J J  Backward Pass The Backward Pass calculates the latest finish (LF) and latest start (LS) times for each activity. It starts from the project’s and date and moves backward through the network diagram, considering activity durations and dependencies.  Late Times types 1. Late Finish (LF): The latest possible finish time for an activity, determined by the latest start time of its succeeding activities. 2. Late Start (LS): The latest possible start time for an activity, calculated based on its late finish time and duration.  Calculating late times 1. Final Activity Case: Late Finish (LF) is equal to the project end time. Late Start (LS) is calculated using the equation: LS = LF – Activity Duration. 2. Successor Activity Case: Late Finish (LF) is equal to the minimum of the late start times of all succeeding activities. Late Start (LS) is calculated using the equation :LS = Minimum of Late Start Times of Successor Activities – Activity Duration. 3. Calculation Method: Start with identifying the final activity. For each preceding activity, calculate the late finish and late start using the equations mentioned above. Determine the late finish and late start for all activities sequentially to reach the starting point.  Late Time Equations 1. If the activity is linked to more than one other activity from the end 2. If the activity is linked to one activity of the end side  E(9) J(3) 2 ) 5 8 N(9 A(3 F(1) K(6 ) ) ) B(4) G(4) L(3) 1 3 6 9 D(3 H(5 ) ) C(6 ) M(6 I(4) 4 7 )