Critical Path Calculation / Network Diagram

Hi Friends,

For the following activieis, We need to

Find the critical path

Draw the network diagram

Find Total, Free and Independent float?         

Activity

1-2

1-3

1-4

2-5

3-6

3-7

4-6

5-8

6-9

7-8

8-9

Duration (Months)

2

2

1

4

8

5

3

1

5

4

3

 

 Below is my working.  But Network diagram is not visible properly even after copying from Word.   From the above table, it can be easily drawn.    I face hurdle while calculating the FREE Float and Total Float of each activity.  Guide me to get them done ASAP.

 

1.       Let’s draw the network diagram

2.       Find all the paths in the diagram. A path is any string of activities goes from the start of the project to the end.  From the diagram and the given information in the problem definition, assuming that the Activity 1 is a starting point and Activity 9 is the ending point.

A6

A4


A9


A5


A2


A3


A7


A8


A1

                                                                                       3

 

                               1

                                                                                         8                                                                          5

                                       2                                              5

                                                                                                                                   4                                       3

                                       2                                                                                                  1

                                                                                     4

 

 

Paths:

A1 à A4 à A6 à A9

A1 à A3 à A7 à A8 à A9

A1 à A3 à A6 à A9

A1 à A2 à A5 à A8 à A9

 

3.       Find the duration of each path by adding up the durations of each of the activities on the path.

A1 à A4 à A6 à A9                      è           1 + 3 + 5 = 9

A1 à A3 à A7 à A8 à A9         è           2 + 5 + 4 + 3 = 14

A1 à A3 à A6 à A9                      è           2 + 8 + 5 = 15                      ç Critical Path

A1 à A2 à A5 à A8 à A9         è           2 + 4 + 1 + 3 = 10

 

The critical path is the one with the longest duration.

 

Finding the Float for each activity

The float for any activity is the amount of time that it can slip before it causes your project to be delayed. You might also see the word “slack” – it’s the same thing.

 

1.       Write down all the paths in the Network diagram.

There are 4 possible paths in the network diagram.

A1 à A4 à A6 à A9

A1 à A3 à A7 à A8 à A9

A1 à A3 à A6 à A9

A1 à A2 à A5 à A8 à A9

2.       Float for each activity in the critical path is ZERO

3.       Find the next longest path. Subtract its duration from the duration of the critical path, and that’s the float for each activity on it.

Next longest path is A1 à A3 à A7 à A8 à A9                è           2 + 5 + 4 + 3 = 14

Duration of this path is 14

Duration of the critical path is 15

So, the float is 15 – 14 = 1

Float for the activity A3 remains same as ZERO as it is already found as per the critical path. It won’t change.

Float for the activities A7 and A8 are 1 and 1 respectively.

 

          4.       Do the same for next longest path in the network diagram.

Next longest path is A1 à A2 à A5 à A8 à A9                è           2 + 4 + 1 + 3 = 10

Duration of this path is 10

Duration of the critical path is 15

So, the float is 5

Float for Activities A8 and A9 are already found in the previous steps.

Float for Activities A2 and A5 are 5 and 5 respectively.

 

5.       Do the same for next longest path in the network diagram.

Next longest path is A1 à A4 à A6 à A9                            è           1 + 3 + 5 = 9

Duration of this path is 9

Duration of the critical path is 15

So, the float is 6

Float for Activities A6 and A9 are already found in the previous steps.

Float for Activity A4 is 6.

 

 

First of all you are practicing - AOA method, stop it. PMI/PMP doesn't follow this method. it has been absolete and old. forget this.


take examples of only AON methods.


I tried over above example modiying it in AON.









































































































































































































































































































































coding A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11
Activity 1--2 1--3 1--4 2--5 3--6 3--7 4--6 5--8 6--9 7--8 8--9
Duration (Months) 2 2 1 4 8 5 3 1 5 4 3
                       
    BY 1 START METHOD          
  1 1 2 4              
    A3/1M   A7/3Ms   11 15        
          A9/5Ms   END    
  7 7 8 10          
            11 15        
                       
    LEGEND 3 10 8 11 12 14      
    CRITICAL
PATH
  A5/8Ms   A10/4Ms   A11/3Ms   ESs -ESp-Dp EF-ES =LF-LS
           
      3 10 9 12 13 15  
                  ACTI
VITY
                  .=FF .=TF
START 1 2 3 7 7 7     A1 0 5
  A2/2Ms   A6/5Ms   A8/1M     A3 0 6
            A4 0 5
  1 2 4 8 12 12     A6 0 1
              LEGEND   A7 6 6
  1 2 3 6   ES EF   A8 4 5
    A1/2Ms   A4/4Ms     ACTIVITY/
DURATION
  A10 0 1
            A11 1 1
  6 7 8 11   LS LF        

Hi sspawar,

I referred Head First PMP to draw Network diagram using CPM method. Please give me some reference for AON method which you are talking about.

In AOA - activities are presented like 1---2, 1----3, ......


In your calculation == Total No of activities shown, only nine, while these activities are 11. So it is not AON method.


In AON method these question will be asked like this:




























































































  Activity Duration predecessor  
  start 0 .-  
1--2 A1 2 start  
1--3 A2 2 start  
1--4 A3 1 start  
2--4 A4 4 A1 1--2
3--6 A5 8 A2 1--3
3--7 A6 5 A2 1--2
4--6 A7 3 A3 1--4
5--8 A8 1 A4 2--4
6--9 A9 5 A5 and A7 3--6,4--6
7--8 A10 4 A6 3--7
8--9 A11 3 A8 and A10 5--8,7--8
  end 0 .-  


I could not go through HF, but I know Andy and Rita only follow the AON method.


----------------------------------


what diagram you wanted to paste here - also seems vitally different. You may email me on pawarindo@gmail.com


-----------------


I just have a look at all network related /time management chapter of HF, it is also following AON method without making any comments / information over AOA. It is saying just CPM.


While CPM has two types of methods - AON and AOA, since AOA has been obsolete now, hence everyone has skipped it. In objective questions it is mentioned, sometimes, just for creating an option.


Perhaps you have taken this example from some other books based on AOA and now you are mixing it.


-------------------------------------------------


FF (free float) = by definition FF of any non critical activity is a duration by which that can be delayed so that ES of successor activity could not be delayed.


FF = ESs - ESp -Dp = EFs - EFp - Dp , it happens only when 2 or more predecessor converge at a successor activity. (s stands for successor or following activity and p stands for present or questioned activity)


TF some books only use term Float for total float (total float ) = An activity on non critical path can be delayed by a duration so that project finish date could not be delayed.


TF = LS-ES = LF-LS


it means that successor activity can be delayed by its ES date but project finish date will not be delayed.


---------------------