4. Network Calculations

Size: px

Start display at page:

Download "4. Network Calculations"

Julie Baker
5 years ago
Views:

Construction Project Management (CE 110401346) 4. Network Calculations Dr.

1 Construction Project Management (CE ) 4. Network Calculations Dr. Khaled Hyari Department of Civil Engineering Hashemite University Calculations On a Precedence Network I Early Activity Start (ES): Earliest time an activity can start as determined by the latest of the early finish times of all immediate preceding activities (IPAs) Early Activity Finish (EF): Earliest time an activity can finish determined by adding the duration of the activity to the early start time Late Activity Start (LS): Latest time an activity can start without delaying the project completion Late Activity Finish (LF): Latest time an activity can be finished without delaying project completion ١

2 Calculations On a Precedence Network II Early Event Occurrence Time: Earliest an event can occur determined by the latest early finish Late Event Occurrence Time: Latest an event can occur Calculations On a Precedence Network III Step 1: Perform Forward Pass Calculations to determine: Early Start (ES) and Early Finish (EF) of each activity. ES (initial activities) = S ES (x) = Latest (EF (all predecessors of x)) EF (x) = ES(x) + D(x) Where, S= Project start time. D(x) = Duration of activity x. ES(x)= Earliest start time of activity x. EF(x) = Earliest finish time of activity x. ٢

3 Calculations On a Precedence Network IV Illustrating computations on a precedence diagram All relationships are assumed to be Finish-to-Start Early Times (Early Start [ES] and Early Finish [EF]) Calculations On a Precedence Network V 1. Assign 1 as the early start date of the first activity 2. Calculate the early finish time for the activity 3. The early start of activities will be determined by the early finish times of preceding activities Other than the first activity or activities 4. Repeat steps 2 and 3 for each network activity until ES & EF are determined for the last activity ٣

4 Calculations On a Precedence Network VI Step 2: Perform Backward Pass Calculations to determine: Late Start (LS) and Late Finish (LF) of each activity. LF (end activities) = T LF (x) = Earliest (LS (all successors of x)) LS (x) = LF(x) - D(x) Where, T = Project completion time. D(x) = Duration of activity x. LS(x) = Latest start time of activity x. LF(x) = Latest finish time of activity x. Calculations On a Precedence Network VII ٤

5 Calculations On a Precedence Network VIII Activity TF FF IF Mobilize Remove old Cabinets Buy materials Install new flooring Hang wallpaper Install new cabinets Touch-up paint Demobilize Calculations On a Arrow Network ٥

6 Identify the Critical Path When an activity start date is fixed in this way, the activity is said to have no float Such activities are said to be critical If the activity starts later than the assigned date, or takes longer to complete than the assigned duration, the project completion date will be extended by the same amount of time Activity Floats I Total Float (TF): maximum amount of time that the activity can be delayed without delaying the completion time of the project. Free Float (FF): maximum amount of time that the activity can be delayed without delaying the early start of any of its successors, assuming its predecessors were completed early. Free Float: Amount of time an activity can be delayed before it impacts the start of any succeeding activity ٦

7 Activity Floats II Independent Float (IF): maximum amount of time that the activity can be delayed without delaying the early start of any of its successors, assuming its predecessors were completed late. Activity Floats III Successors Started Early Late Predecessors Completed Early Free Float Total Float Late Independent Float ٧

8 Activity Floats IV Float Type Total Float Free Float Independent Float TF = LS ES TF = LF EF Calculation FF = Min (ES of all successors ) EF IF = Min (ES of all successors) Max (LF of all predecessors) D Calculations On a Precedence Network IX Once the early and late start times, early and late finish times, free float, and total float of all activities are determined, the calculations are completed ٨

9 Calculations On a Precedence Network X LAG: The amount of time that exists between the early finish of an activity and the early start of a specified succeeding activity Example 2: Network Calculations I Activity Description Predecessors Duration A Preliminary design - 6 B Evaluation of design A 1 C Contract negotiation - 8 D Preparation of fabrication plant C 5 E Final design B, C 9 F Fabrication of Product D, E 12 G Shipment of Product to owner F 3 ٩

10 Example 2: Network Calculations II Example 2: Network Calculations III Activity Duration ES EF LS LF A 6 B 1 C 8 D 5 E 9 F 12 G 3 ١٠

11 Example 2: Network Calculations III Activity Duration ES EF LS LF A B C D E F G Example 2: Network Calculations IV Activity Duration ES EF LS LF TF FF IF A B C D E F G ١١

12 Example 2: Network Calculations IV Activity Duration ES EF LS LF TF FF IF A B C D E F G Example 3: Network Calculations I ١٢

13 Example 3: Network Calculations II Example 3: Network Calculations III Activity Duration A 4 Early Start Early Finish Late Start Late Finish B 3 C 8 D 7 E 9 F 12 G 2 H 5 I 6 ١٣

14 Example 3: Network Calculations III Early Early Late Late Activity Duration Start Finish Start Finish A B C D E F G H I Example 3: Network Calculations IV Activity Duration ES EF LS LF TF FF IF A B C D E F G H I ١٤

15 Example 3: Network Calculations IV Activity Duration ES EF LS LF TF FF IF A B C D E F G H I Precedence Diagram Relationships I Types of Logical Precedence Relationships in PDM Finish to Start (with or without lag): Each activity depends on the completion of its preceding activity ١٥

16 Precedence Diagram Relationships II Typical Sequence of Finish-to- Start Relationships Finish-to-Start Relationship with a 28-Day Delay (lag) Precedence Diagram Relationships III Types of Logical Precedence Relationships in PDM Start to Start (with or without lag). ١٦

17 Precedence Diagram Relationships IV Activities with Start-to-Start Relationships Precedence Diagram Relationships V Activities with Start-to-Start with a Delay Relationships ١٧

18 Precedence Diagram Relationships VI Activities with Start-to-Start with a Delay Relationships Precedence Diagram Relationships VII Types of Logical Precedence Relationships in PDM Finish to Finish (with or without lag). ١٨

19 Precedence Diagram Relationships VIII Finish-to-Finish (FF) Precedence Diagram Relationships IX Finish-to-Finish (FF) with Delay Finish-to-Start Relationship for Window Installation ١٩

20 Precedence Diagram Relationships X Activities with Finish-to-Finish with a Delay (lag) Relationships Precedence Diagram Relationships XI Types of Logical Precedence Relationships in PDM Start to Finish (with or without lag). ٢٠

21 Precedence Diagram Relationships XII Start-to-Finish with a Delay Relationships Precedence Diagram Relationships XIII Start-to-Finish with a Delay Relationships ٢١

22 Precedence Diagram Relationships XIV Start-to-Finish with a Delay Relationships Precedence Diagram Method Advantages of PDM Over CPM: Easier to construct & modify network. No need for dummies. Less activities in presentation. Precedence relationships with lag times are more effective in modeling project activities. ٢٢

23 Types of Activities Milestones: are points in time that are identified as important intermediate dates. Example: a weather-imposed date to finish exterior activities. Schedule Milestone : A significant event in the project schedule, such as an event restraining future work or marking the completion of a major deliverable A schedule milestone has zero durations Types of Activities II Hammock Activity: an activity that extends from one activity to another but has no duration of its own. Example: Dewatering activity. ٢٣

PROGRAMMING CPM. Network Analysis. Goal:

PROGRAMMING CPM. Network Analysis. Goal: PROGRAMMING CPM 5/21/13 Network Analysis Goal: Calculate completion time Calculate start and finish date for each activity Identify critical activities Identify requirements and flows of resources (materials,