1. SCHEDULING Critical Activities are: B, F, I, M, Q

2. RULES No worker may remain idle if there is an activity that can be started. Once a worker starts an activity he must continue until he finishes that activity. The objective is to complete the project with as few workers as possible or to complete the project with the available workers in a minimum time. There is no algorithm that guarantees an optimal solution. Adopt this procedure: When a worker completes an activity, consider all the activities that have not been started but that can now be started. Assign the worker to the activity whose latest start time is the smallest - this is in a sense the “most critical” activity. If there are no activities that can be started at this time, the worker will have to wait until an activity can be assigned.

3. In order to assign the workers in the correct order, it is a good idea to make a list of the earliest and latest start times for each activity. E(4) 3510 For example: The earliest that activity E can start is 3 The latest that activity E can finish is The duration of activity E is 4 So the latest that activity E can start is 6

4. AActivity Duration Earliest Start Latest Start 10 0 4 B 7 0 0 C 9 0 4 D 8 14 E 13 7 9 F 9 7 7 G 3 9 H 14 9 15 I 11 16 J 12 16 17 K 10 20 25 L 5 20 22 M 8 27 N 9 28 P 8 29 Q 2 35

5. ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start 10 0 0 00 447 77 7889 9 99 99 14 13 15 11 16 17 12 20 22 3 25 5 27 8 28 2 2935 Latest Start time that is the smallest is: B B Next Latest Start time that is the smallest is: C C A A F F Earliest Start 7 E 7 5 1015 2025303540 0 Hours E The latest E can start without delays is 9 G 9 The latest G can start without delays is 13 G but G can start at 10 D 10 The latest D can start without delays is 14 but D can start at 13 D H 9 The latest H can start without delays is 15 So another worker is needed to avoid delays H H starts as early as possible I 16 I J The latest J can start without delays is 17 J starts as early as possible J 20 The latest L can start without delays is 22 L cannot start at 21 because it is dependent on E L

7. ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start 1079813931411121058892 000 779916 20 27 2835 404149713151617252227282935 5 1015 2025303540 0 Hours B C A F E GD H I J Next Latest Start time that is the smallest is: K Earliest Start L 20 The latest K can start without delays is 25 K cannot start at 21 because it is dependent on E

9. ActivityABCDEFGHIJKLMNPQ Duration Earliest Start Latest Start 1079813931411121058892 000 779916 20 27 2835 404149713151617252227282935 5 1015 2025303540 0 Hours B C A F E GD H I J Next Latest Start time that is the smallest is: M Earliest Start L 27 K M N N P 28 P Q 35 Q The job needs 5 workers to complete it in a minimum time of 37 hours Scheduling completed!