This document provides an overview of critical path method (CPM) calculation and analysis for a project management design course. It defines key terms like critical path, critical activities, and float. It also outlines the steps for CPM analysis, including drawing the network diagram, determining earliest and latest start/finish times, identifying float, finding the critical path, and calculating the project duration. Finally, it provides a sample problem and requirements for performing CPM analysis on a network with multiple activities and predecessors.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
85 views4 pages
Earliest Start Time (Es) : CPM Analysis Page of
This document provides an overview of critical path method (CPM) calculation and analysis for a project management design course. It defines key terms like critical path, critical activities, and float. It also outlines the steps for CPM analysis, including drawing the network diagram, determining earliest and latest start/finish times, identifying float, finding the critical path, and calculating the project duration. Finally, it provides a sample problem and requirements for performing CPM analysis on a network with multiple activities and predecessors.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4
PEB 601 DESIGN Project 1
Semester 2 2020 BE -SME/SEEE/SBCE, YEAR2
CPM CALCULATION Path – a connected sequence of activities leading from the starting event to ending event Critical path- the longest path (time); determines the project duration Critical activities –all the activities that make up the critical path Float is the maximum amount of time that an activity can be delayed in its completion before it becomes a critical activity. i.e. delays completion of the project FORWARD PASS EARLIEST START TIME (ES) o Earliest time an activity can start o ES= maximum EF of immediate predecessors EARLIEST FINISH TIME (EF) o Earliest time an activity can finish o Earliest start plus activity time o EF=ES plus time (t) BACKWARD PASS LATEST START TIME (LS) o Latest time an activity can start without delaying critical path time LS =LF MINUS TIME (t) LATEST FINISH TIME (LF) o Latest time an activity can be completed without delaying critical path time LF= Minimum LS of immediate predecessor
STEPS IN CPM ANALYSIS
CPM ANALYSIS Page 1 of 4 1. Draw the CPM network 2. Analyze the path through the network using key box a. Determine the ES, EF, LS. LF 3. Determine the float for each activity 4. Find the critical path ie. Zero slack 5. Find the project duration (minimum project completion time) Sample Problem Exercise Given : Activity Predecessor Duration (time) days A NONE 6 B NONE 8 C NONE 5 D B 3 E C 9 F A 15 G A 17 H F 9
I G 6 J D,E 12
CPM ANALYSIS Page 2 of 4
NETWORK DIAGRAM Requirements: 1. Draw NETWORK DIAGRAM (given) 2. Draw the Key Box 3. Compute for the ES and EF times 4. Compute for the LS & LF times 5. Compute for the Floats or Slack times 6. Identify the Critical paths & duration 7. Summarize results in a matrix format a. Activity b. Duration c. Early start(ES) d. Early Finish (EF) e. Late Start (LS) f. Late Finish (LF) g. Slack/Float (S/F) h. CRITICAL PATHS
Journal of Medicinal Chemistry Volume 21 Issue 6 1978 (Doi 10.1021/jm00204a013) Hansch, Corwin Hatheway, Gerard J. Quinn, Frank R. Greenberg, - Antitumor 1 - (X-Aryl) - 3,3-Dialkyltriazenes. 2. On T