This procedure is described in following steps.

1. List the activities and the precedence relationships
2. Construct the project network.
3. Estimate each activity time.
4. Find the earliest start time and the earliest finish time for each activity (forward pass calculations).
5. Find the latest start time and the latest finish time for each activity (backward pass calculations).
6. Calculate the total slack for each activity.
7. All of the critical activities have a total slack equal to 0.
8. A critical path from the starting node to the finishing node uses only critical activities.