Critical Path Analysis Why Is CPA Important CPA

Critical Path Analysis

Why Is CPA Important? • CPA is arguably the piece of maths used most often, outside of basic arithmetic. • Important not only in commerce and industry, but also in our own lives. • Can be used to ensure the efficient running of any Project!

Project A Project can be defined as any activity with: • A defined purpose • A clear start and finish

Other Considerations • Other types of dependencies – Planned delays – e. g. plaster drying – Start dependencies • Delays on Critical Path, e. g. – Goods not delivered – Weather delays

Activities of a particular project are usually set out in a precedent / dependent table. This table shows the activities which cannot start until a previous activity has been completed. An example is as follows: ACTIVITY DEPENDS ON A - B - C A, B D B E B F C G C, D H E

The common method to establish the general shape of an Activity Network, is to use an Activity on Arc method. Terminology; Arc; denoted by a straight line which shows the activity. Node; denoted by a circle to signify the end of an activity. Each node in numbered from 0 to n. Node 0 is called the source node. The final node is called the sink node. Dummy; A dummy arc is required if a particular activity requires two or more activities to finish prior to the new activity starting

Using our example dependent table. C 3 F 1 A G 4 0 B 6 D H 2 E 5

An Alternative Approach. . .

WORKED EXAMPLE ABC Manufacturing Ltd construct luxury sofas by hand on an order by order basis. The sofa consists of various tasks which must be completed in order. The activities are as follows: A; Build a Wooden Frame B; Cut out material for cushions C; Stitch and fill cushions D; Attach springs to wooden frame E; Cover Frame F; Complete Assembly G; Inspect H; Wrap

The information is supplied in a Dependency table Activity Dependent on Time of Activity (hrs) A - 6 B - 2 C B 3 D A 4 E D 2 F C, D 4 G F 2 H G 1

Your task is to create an activity network from the information given, (hint – you will require 1 dummy arcs).

D 1 E 4 A 7 H 00 B 6 2 C 3 F 5 G

Carrying out the algorithm

Step One: Draw an Activity-On-Arc Network

Step Two: The forward Pass 6 In the Left hand box, we write the EARLIEST TIME that you can move onto the next task

6 2 10 10 17 14 16 This is 10 and not 5 because we have to have done D as well as C before we can move onto F. We have to pick the latest.

Step Three: The backward Pass In the Right Hand box we write the latest the next activity needs to start in order to finish on time. We go backwards. The first one is always the same as the forward pass. 17 17 16 16

The box after D says 10 and not 15 because we have to get F, G and H done. Activity E doesn’t have to start until 12, but we must write down the lower number. 6 0 6 10 10 17 17 0 2 7 10 10 14 14 16 16 The box after B says 7 because in order to be done by 10, C doesn’t have to start until 7.

If the latest an activity must have finished by take away the earliest it can start is the length of the activity, then the activity is CRITICAL. 6 0 6 10 10 17 17 0 2 7 10 10 14 14 16 16 The CRITICAL PATH is the list of activities that are CRITICAL. If an activity isn’t critical, it has FLOAT. E is not critical because 17 - 10 > 2. E has a float of 5. E can start any time between 10 and 15.