Scheduling, AON (Using Linear Programming to Find a Critical Path)

1. List all the necessary tasks in the project or process?

2. Determine the correct sequence of the tasks?

3. Diagram the network of tasks?

4. When the network is correct, label all events in sequence with event numbers in the circles?

5. Determine task timesthe best estimate of the time that each task should require?

6. Determine the "critical path," the longest path from the beginning to the end of the project?

7. Calculate the earliest times each task can start and finish, based on how long preceding tasks take?

8. Calculate the latest times each task can start and finish without upsetting the project schedule, based on how long later tasks will take?

9. Calculate slack times for each task and for the entire project?

Task	Precedence	Time
a	-	3 Weeks
b	-	5 Weeks
c	a	14 Weeks
d	a	5 Weeks
e	b	4 Weeks
f	b	7 Weeks
g	d, e	8 Weeks
h	g, f	5 Weeks