UPI Study › Courses › System Analysis and Design › Free lessons › Lesson 9.4 Free with a free account
Project Scheduling Mastery: Techniques, Critical Path Analysis, Total Slack, and Free Slack
System Analysis and Design · Chapter 9: Project Management, Scheduling, and QualitySection 9.4 · lesson 63 of 698 min · free with a free account
Free preview
Create a free account to keep watching
It takes a minute and costs nothing. Your free account unlocks all of Chapter 1 and 3 more lessons of System Analysis and Design.
Lesson complete
Earn the 3 college credits for System Analysis and Design
Enrolling adds a quiz after each lesson, the graded work and the official transcript. Recommended for credit by NCCRS.
Next lesson: Feasibility Studies, Team Dynamics, and Building the Work Breakdown Structure →← Project Planning: Procedures, Processes, and ToolkitsNext lesson: Feasibility Studies, Team Dynamics, and Building the Work Breakdown Structure →
In this lesson
Dependencies, AON diagrams, PERT estimates, forward and backward passes, and slack.
- Explain activity dependencies, and read an AON network diagram
- Apply the three-point PERT formula
- Perform forward and backward passes to find ES, EF, LS, and LF
- Distinguish total from free slack, and compare crashing with fast-tracking
Transcript
Everything said in the video, section by section (1,104 words). Read along, or search it.
Project Management, Scheduling, and Quality
Project Scheduling and the Critical Path
A plan becomes a schedule once you know what depends on what, and how long each piece takes. This section works through one small project, step by step. Dependencies and network diagrams, a formula for estimating durations, and the forward and backward passes that find the critical path. Then the two kinds of slack, and two ways to finish a project sooner.
Activity Sequencing
The Worked Example: 6 Activities
A schedule starts with a list of activities, and the dependencies between them. Most dependencies are finish-to-start. An activity cannot start until its predecessor finishes. Other types exist, such as start-to-start, finish-to-finish, and start-to-finish, for activities that overlap in other ways. But finish-to-start is by far the most common. The worked example has six activities. A takes three days, and must finish before B or C can start. B takes five days, and must finish before D, which takes four. C takes four days, and must finish before E, which takes six. And F, the final activity, takes three days, and cannot start until both D and E are finished.
Three-Point Estimates
The PERT Formula
A single duration estimate hides how uncertain it really is. A three-point estimate asks for three numbers instead. An optimistic duration, if everything goes right. A most likely duration. And a pessimistic duration, if things go wrong. The PERT formula combines them into one weighted estimate. Add the optimistic value, four times the most likely value, and the pessimistic value, then divide by six. Weighting the most likely value by four pulls the estimate toward it. For activity B, an analyst gathered an optimistic estimate of three days, a most likely of five, and a pessimistic of nine. Three, plus four times five, plus nine, gives thirty-two. Divided by six, that is about five point three three days. That estimate could replace B's duration in the network. To keep the arithmetic clean, the passes that follow keep B at five days.
Critical Path Method
Forward Pass, Then Backward Pass
The critical path method works through the network twice. The forward pass moves left to right. It finds each activity's early start and early finish, the soonest it could start and finish. An activity's early start is the largest early finish among all of its predecessors. The first activity starts at zero. And its early finish is simply its early start, plus its duration. The backward pass moves right to left, from the project's finish. It finds each activity's late finish and late start, the latest it could run without delaying the whole project. An activity's late finish is the smallest late start among its successors. For the last activity, it is the project's finish. And its late start is its late finish, minus its duration.
Figure 9.1
The Completed Network
Here is the worked example as an activity-on-node diagram. Each activity is a box, and the arrows show the dependencies. This notation has become the standard, largely because each activity's calculated values fit right inside its own box. Each box shows the activity's duration, its early start and early finish, and its late start and late finish. The highlighted boxes and arrows, A, then C, then E, then F, are the critical path.
The Passes, Activity by Activity
Every Value in One Table
Here is how the passes played out. Forward, A starts at zero and finishes at three. B and C can both start at three. B finishes at eight, and C at seven. D starts once B finishes, at eight, and finishes at twelve. E starts once C finishes, at seven, and finishes at thirteen. F needs both D and E. D finishes at twelve, E at thirteen, so F's early start is the larger, thirteen. F finishes at sixteen. That is the project's earliest possible finish. Backward from day sixteen, B's late finish of nine comes from D's late start. And A's late finish of three is the smaller of B's and C's late starts. Total slack is late start minus early start. A, C, E, and F have none. B and D have one day each. The activities with zero slack form the critical path. It is the longest path through the network, and any delay on it delays the whole project.
2 Kinds of Slack
Total Slack vs. Free Slack
Slack comes in two kinds. Total slack is how much an activity can slip without delaying the project's finish. Free slack is stricter. It is how much an activity can slip without delaying the early start of its very next successor. It is the successor's early start, minus the activity's own early finish. B and D show why the difference matters. Both have one day of total slack. But B's free slack is zero. D's early start sits exactly at B's early finish, day eight. So any delay to B pushes D out immediately, even though the project as a whole absorbs it. D's free slack is the full day. F cannot start until day thirteen regardless, so it makes no difference whether D finishes on day twelve or thirteen.
Schedule Compression
Crashing vs. Fast-Tracking
When a project has to finish sooner than the critical path allows, two compression techniques are common. Crashing adds resources to a critical path activity, to shorten its duration. Assigning two more developers to activity E, so it takes four days instead of six, is crashing. It usually costs more, and the benefit shrinks the further an activity is crashed. Fast-tracking overlaps activities that would normally run one after another, doing them in parallel. Starting E before C is fully finished, based on C's partial results, is fast-tracking. The trade-off is a higher risk of rework. Both only work on the critical path. Shortening B or D would not shorten the project at all.
Key Terms
The Vocabulary of This Section
Let's lock in the key terms. A finish-to-start dependency means a successor cannot begin until its predecessor is done. An activity-on-node diagram shows activities as nodes, and dependencies as arrows. A PERT estimate is the optimistic value, plus four times the most likely, plus the pessimistic, all divided by six. The critical path is the zero-slack path that sets the shortest possible duration. Total slack is delay tolerance against the project finish. Free slack is delay tolerance against the next activity. And crashing adds resources, while fast-tracking overlaps activities.
Key Takeaways
What to Carry Forward
To pull this together. Most activity dependencies are finish-to-start, and an activity-on-node diagram shows them as nodes and arrows. A PERT estimate blends optimistic, most likely, and pessimistic durations into one weighted number. The forward pass finds each activity's early start and finish. The backward pass, from the project's finish, finds its late start and finish. Total slack measures tolerance against the project finish, free slack against the next activity, and the critical path is the chain with zero total slack. And crashing adds resources, while fast-tracking overlaps activities. Both apply only to the critical path.
About System Analysis and Design at UPI Study
System Analysis and Design (Computer Science 390) is a self-paced online course of 69 video lessons in 9 chapters, from the analyst's role and requirements to UML modeling, interface and database design, testing, maintenance and project management. It carries a NCCRS credit recommendation for 3 semester credits.
Every lesson transcript is free on pages like this one, and the videos are free with a free UPI Study account. Enrolling adds a practice quiz after each lesson, the graded work and final exam that earn the credit, lifetime access, and an official transcript on completion. UPI Study has helped over 130,000 students with college credits. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
Enroll now → Course details Download the syllabus All Computer Science courses Every course with PRO →
Why take it here
Why students take System Analysis and Design with UPI Study
Where the credit goes
Universities that work with NCCRS
System Analysis and Design carries a NCCRS credit recommendation. These universities work with NCCRS; some are UPI Study's signed partners. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
Thomas Edison State UniversitySigned partner
University of the PeopleSigned partner
Charter Oak State CollegeSigned partner
Strayer UniversitySigned partner
Columbia Southern UniversitySigned partner
Indiana TechSigned partner
Penn StateWorks with NCCRS
Southern New Hampshire UniversityWorks with NCCRS
SUNYWorks with NCCRS
+many more cooperating universitiesFind my college →Find my college → Not listed? Ask Athena in the corner of this page, or book a 15-minute call.
FAQ
Questions students ask us
About Project Scheduling Mastery: Techniques, Critical Path Analysis, Total Slack, and Free Slack
How do you calculate a PERT estimate?
How do you find the critical path using forward and backward passes?
What is the difference between total slack and free slack?
What is the difference between crashing and fast-tracking a schedule?
About the System Analysis and Design course
How many college credits is System Analysis and Design?
How much does System Analysis and Design cost and what is included?
Which universities accept UPI Study credits?
How long does System Analysis and Design take?
How are the exams done?
How do my credits reach my college?
Ready for the full course? Earn 3 credits in System Analysis and Design.
69 video lessons, a quiz after each one, and the graded work that earns the credit. Recommended for credit by NCCRS.
3 credits · NCCRSEnroll →