Practise critical path analysis from precedence data, building activity networks, timing events, floats and worker decisions from project charts.
Draw the activity network described in the precedence table, using activity on arc and the minimum number of dummies.
Given that
- the activity network contains only one critical path
- activity E is on this critical path
state
which activities could never be critical,
which activities must be critical.
Diagram 1
Diagram 2
Figure 2
[The sum of the durations of all the activities is 133 days]
A project is modelled by the activity network shown in Figure 2. The activities are represented by the arcs. The number in brackets on each arc gives the time, in days, to complete the activity. Each activity requires one worker. The project is to be completed in the shortest possible time.
Complete the precedence table in the answer book.
Complete Diagram 1 in the answer book to show the early event times and the late event times.
State the critical activities.
Calculate the total float for activity J. You must make the numbers you use in your calculation clear.
Calculate a lower bound for the number of workers needed to complete the project in the minimum time. You must show your working.
Diagram 2 in the answer book shows a partly completed scheduling diagram for this project.
Complete the scheduling diagram, using the minimum number of workers, so that the project is completed in the minimum time.
