## Chapter

(a) Activity I) dangles, giving the project two "end events'. This network should 6.1 Errors drawing be drawn as below. To aid comparison with the original, the nodes have not activity networks been renumbered, although we would normally do so.

(b) Once again, this network has two end nodes, but in this case the solution is slightly different since we should introduce a dummy activity if wc are to follow the standard CPM conventions.

(c) Either this one has a dangle (although, because of the way it is drawn, it is less obvious) or activity E has its arrow pointing in the wrong direction. We need a bit more information before we can redraw this one correctly.

(d) Strictly speaking, there is nothing wrong with this one - it is just badly drawn and the nodes are not numbered according to the standard conventions. It should be redraw n as in the follow ing example.

In this diagram the nodes have retained their original numbers (to aid identification) although they should of course he renumbered sequentially from left to right.

(e) This one contains a loop - F cannot start before (i has finished. Cî cannot start before E has finished and E cannot start before G has finished. One of the arrows is wrong! It is probably activity F that is wrong but we cannot be sure w ithout further information.

Figure F.6 Iirigelte's CPM network.

6.2 Drawing Brigette's activity network as a CPM network

Brigette's payroll CPM network should look like the diagram below. If your diagram is not exactly the same as this check that it is logically the same.

Figure F.6 Iirigelte's CPM network.

### 6.3 Drawing a CPM network

A solution is given in Figure 6.3. If your solution is not exactly the same as this do not worry. Just check that it is logically the same and that it follows the CPM conventions of layout and node numbering etc.

### 6.4 Calculating activity floats

Free float and interfering float for each of the activities are shown in Table F.9 below. Note that activity A has no free float since any delay in its completion will delay the start of activity C. Activity C, however, has a 2-week free float so long as activity A keeps to time. Moat must be regularly monitored as a project progresses since a delay in any activity beyond its free float allowance will eat into the float of subsequent activities.

Table F.9 Activity floats

 Activity Total float Free float Interfering float A 2 0 ■j B 3 0 3 C "> mm -> 0 D 3 3 0 E 3 3 0 F 0 0 0 C. 0 0 0 H ? Am 2 0

6.5 Shortening a project duration

Shortening activity F to 8 weeks will bring the project completion dale forward to week 11 - that is, it w ill save 2 weeks on the duration of the project. However, there are now two critical paths. I -5-6 and I -2-4-6. so that reducing the duration of activity F any further w ill not shorten the project duration any further. If we wish to complete the project earlier than week 11 we must save time on path 1-5-6 and path 1-2-4-6.

Figure F7 illustrates a precedence network for Amanda's project showing an 6.6 Theprecedence earliest completion date of day 96. network

loC/P/31

TSOiyi 1

5Eid

6t 66

tag* OOiyi

TSOiyi 1

sfio£

P/S ] Itoay» ■

'34

Sc»crfy moOJm O

6t 66

tag* OOiyi

 |lcC/P«| taw 61 7 Q»^yT67 67 P i2 3 Cfld»1WI OM •64 B " 70 9 Oaft _ J Olyt ~£ P 9 _ «.Uyt, |AC PTJ IS V. Jci 1 Dwy T 65; Cod* sett 90, 79 iwodiAc^ 63' 63 C 96 gawl '»«»TV 33 1^»] u io€P 10 *a*r* loEP 14 25 1 61 Owfn 65 65 CodtlMt 90 73' 73 ~ » Mil 8 Figure F.7 Amanda's precedence network. 7.1 Brigette's Among the factors that she might consider are the following,