Presentation is loading. Please wait.

Presentation is loading. Please wait.

Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 1 CPM Network Computation.

Similar presentations


Presentation on theme: "Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 1 CPM Network Computation."— Presentation transcript:

1 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 1 CPM Network Computation

2 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 2 AOA AON

3 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 3 Drawing CPM Networks Prerequisites: Before drawing a CPM network, we must have: –List of all activities comprising the project –Order of precedence of each activity –Duration estimate of each activity

4 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 4 Example:

5 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 5 Activity on arrow Solution

6 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 6 Activity-on-node Solution

7 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 7

8 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 8 Activity on Node Nodes = Activities Links = Precedence Relationships Dummy activities are not required

9 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 9 Example

10 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 10 AON

11 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 11 AON

12 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 12 Constraints with Lead/lag time

13 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 13 Finish-to-Start (FS ij ): FS ij is equal to the minimum number of time units that must transpire from the completion of the predecessor (i) prior to the start of the successor (j). The time between the finish of one activity and the start of its successor is called Lag.

14 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 14 Finish-to-Start (FS ij ): If the relationship is not listed on the dependency arrow, FS is assumed with Lag= 0. Example: a planner may wish to have an activity of removing formwork from a new building component follow the concrete pour by some pre-defined lag period to allow setting.

15 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 15 Start-to-Start (SS ij ): SSij is equal to the minimum number of time units that must be complete on the preceding activity (i) prior to the start of the successor (j).

16 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 16 Start-to-Start (SS ij ): Lag is always applied to SS relation. Example: parallel in starting of Installing and Finishing the walls activity of 100 rooms on a project must be 10 days difference (SS=10 days). –You dont have to wait installing 100 walls room to start doing the finishing work.

17 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 17 Finish-to-Finish (FF ij ): FF ij is equal to the minimum number of time units that must remain to be completed on the successor (j) after the completion of the predecessor (i). It is applied as productivity control.

18 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 18 Finish-to-Finish (FFij): The finish date of Installing and Finishing walls activity of 100 rooms on a project must have 10 days difference in order to control productivity (FF=10 days). –In this example, the productivity of installing the walls activity might be less than finishing the rooms activity. Lag is always applied to FF relation as buffer between the two activities.

19 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 19 Start-to-Finish (SF ij ): SF ij is equal to the minimum number of time units that must transpire from the start of the predecessor (i) to the completion of the successor (j). It is applied also for controlling productivity

20 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 20 Start-to-Finish (SF ij ): Example: The start date of Installing 100 rooms walls activity and the finish date of Finishing same walls activity of a project must maintain 30 days difference to control productivity (SF=30 days). Lag is always applied to SF relation as buffer between the two activities. It is not recommended to use by planner.

21 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 21 Start-to-Start and Finish-to-Finish (ZZ ij ): ZZij is a combination of two constraints. i.e., a start-to-start and finish-to-finish relationship. It is written with the SSij time units first, followed by the FFij time units. These two relations are used combined to maintain buffer between the start and finish of two activities.

22 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 22 Forward Pass Computations EF j = ES j + D j

23 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 23 Backward Pass Computation LS i = LF i D j

24 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 24 Example

25 Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 25 Example Solution


Download ppt "Spring 2008, King Saud University Activity on Node Dr. Khalid Al-Gahtani 1 CPM Network Computation."

Similar presentations


Ads by Google