A project consists of nine activities, A to I. The durations (in days) of the activities, and the precedence relations, are given in the following table.
Activity Duration Preceding activities
A 8 −
B 5 −
C 3 A, B
D 10 B
E 4 A, B
F 7 A, E
G 2 B
H 6 C, D
I 8 B, D, G
(a) Use the activity network construction algorithm to find an activity network for this project. 
(b) List any redundant arcs in your activity network. (You should ignore them when applying the subsequent algorithms.) 
(c) Use the critical path construction algorithm to compile a table showing the earliest starting time for each activity. Hence find a critical path in the activity network, and state the length of this path. 
(d) Use the algorithm for calculating latest starting times to compile a table showing the latest starting time for each activity. 
(e) Use the critical path scheduling algorithm to find a schedule for the above project for two workers. Is the resulting schedule an optimum one? If so, explain why; if not, write down an improved schedule.
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.
By purchasing this solution you'll be able to access the following files: