FREE PROJECT SCHEDULING LEARNING PATH

WikiFree original practice workbook

The dependency yard

CASE STATUS: fictional/synthetic teaching material. Do not present the example as real research, employment experience or measured business performance.

OUTCOME
Build and update a dependency-based schedule, calculate a critical path and explain the effect of a delay.

BEFORE YOU START
Basic addition and a spreadsheet or paper; no Microsoft Project license is needed.

CASE
Oak Workshop is preparing a training event. Activities use working days, finish-to-start dependencies, zero lags and unlimited parallel resources unless stated otherwise. A starts at time zero.

INPUTS
ID / activity,Duration,Predecessor
A / approve brief,2,None
B / prepare room,3,A
C / build materials,5,A
D / rehearsal,2,B and C
E / final checks,1,D


ENTRY CHECK

Question: Can an activity begin before all required predecessors finish?

Self-check: Not under the finish-to-start rules in this case.

Question: Is the longest single activity always critical?

Self-check: Criticality depends on the longest complete dependency path.

Question: Does a dependency-only schedule prove staff availability?

Self-check: No. Resource constraints require a separate check.

STAGE 1: Define schedulable work

Prerequisite: Basic addition and a spreadsheet or paper; no Microsoft Project license is needed.

Instruction: Turn a deliverable into activities with a clear start, finish and acceptance condition. Distinguish duration from effort: three elapsed days may contain only a few hours of work. State calendar assumptions before adding dates. A precise-looking Gantt chart can conceal an unclear activity definition, so establish the logic in a table first.

Practice task: Describe completion for each activity and record the working-day, resource and dependency assumptions beside the case table.

Deliverable: An activity definition sheet

Acceptance check: Every activity has an observable finish and duration is not confused with effort.

If stuck: Split vague activities such as organize everything into a result with a checkable boundary.

Record your work, decisions and evidence:




Record your result against the acceptance check:



STAGE 2: Draw the dependency network

Prerequisite: Bring your previous output: An activity definition sheet

Instruction: A dependency says what must be true before another activity can start. Do not add a link only because two tasks look convenient side by side. The rehearsal requires both the room and materials, so its start is controlled by the later predecessor. Check for circular dependencies; a cycle cannot be solved by moving bars on a chart.

Practice task: Draw the five-node network and list every dependency. Explain why D waits for C even when B has already finished.

Deliverable: A dependency network and logic note

Acceptance check: A→B→D→E and A→C→D→E are both visible, with no cycle.

If stuck: If a start date is chosen manually, identify the dependency or external constraint justifying it.

Record your work, decisions and evidence:




Record your result against the acceptance check:



STAGE 3: Calculate earliest dates

Prerequisite: Bring your previous output: A dependency network and logic note

Instruction: In a forward pass, an activity’s earliest start is the greatest earliest finish among its predecessors. Earliest finish equals earliest start plus duration. Use time-zero boundaries consistently rather than mixing inclusive calendar dates with elapsed-day arithmetic. Keep the calculations visible so another person can reproduce them without relying on the drawing.

Practice task: Calculate ES and EF for all activities. Compare the two complete paths and identify the earliest project finish.

Deliverable: A forward-pass table

Acceptance check: A:0–2, B:2–5, C:2–7, D:7–9 and E:9–10.

If stuck: If D begins at day five, check that both of its predecessors have completed.

Record your work, decisions and evidence:




Record your result against the acceptance check:



STAGE 4: Find flexibility and test a delay

Prerequisite: Bring your previous output: A forward-pass table

Instruction: A backward pass works from the project finish toward the start. Latest finish is the earliest latest start of the successors; latest start subtracts duration. Total float is latest start minus earliest start under the stated model. Float is not a personal entitlement to delay work. Test an actual change and recalculate the network before reporting its effect.

Practice task: Complete the backward pass, then increase B from three to six days. Recalculate the finish and critical path.

Deliverable: A float table and delay scenario

Acceptance check: Original B float is two days; the changed B finishes at day eight and the project at day eleven.

If stuck: If a three-day activity delay becomes a three-day project delay, account for the original float.

Record your work, decisions and evidence:




Record your result against the acceptance check:



STAGE 5: Publish a usable baseline

Prerequisite: Bring your previous output: A float table and delay scenario

Instruction: A schedule baseline records an agreed model at a point in time. An update should show actual progress, remaining work and changed assumptions, not merely recolor the original plan. Add a resource review before making commitments: the room and materials tasks cannot run in parallel if one person must perform both full time. Report that limitation directly.

Practice task: Create a baseline and revised schedule with one decision request. Add a resource-conflict note and a short explanation for a nontechnical sponsor.

Deliverable: A baseline, update and sponsor note

Acceptance check: The one-day finish impact is explained and resource feasibility is kept separate.

If stuck: If the update hides its assumptions, include a short change log next to the revised dates.

Record your work, decisions and evidence:




Record your result against the acceptance check:



WORKED CASE
The original critical path is A–C–D–E: 2+5+2+1=10 days. B has two days of float. When B takes six days, A–B–D–E becomes 11 days, making the project one day later. These results rely on the stated calendar and unlimited-resource assumptions.

FINAL PROJECT
Produce the Oak scheduling pack with dependency diagram, forward/backward calculations, baseline, delay scenario and resource-feasibility note.

REQUIRED CRITICAL CHECK
Do not present a dependency-only calculation as a resource-feasible commitment or silently change the time convention.

SCORING
Score each of the five stage acceptance checks from 0–16 (0 missing/incorrect; 8 partially supported; 16 complete and evidenced). Score the final integrated project from 0–20 (0 missing; 10 incomplete handover; 20 complete, reproducible and consistent with the case). Target: at least 80/100 AND the critical check must pass. A total score never overrides a failed critical check.

SCOPE LIMIT
This path covers a small deterministic network; probabilistic scheduling and complex resource leveling are outside scope.

SOURCES AND ACCESS
Assigned public videos can be watched free. Complete the original case in a text editor, on paper or in a spreadsheet you already have. No paid course, exam or provider certificate is included.

Free Project Planning Course: Budgets and Risks
WikiFree: https://wikifree.com/courses/google-project-planning-free-video-course/
Official source: https://www.youtube.com/playlist?list=PLTZYG7bZ1u6rleiXxZOifusKwZka2KJRs
Why selected: The planning lesson supplies the work-definition context. The critical-path calculations and examples are original WikiFree instruction.

Stage 1 selected lessons:

4. Project Planning for Beginners (36:55)
https://www.youtube.com/watch?v=hHPAc0LFfZA&list=PLTZYG7bZ1u6rleiXxZOifusKwZka2KJRs&index=4

REUSE
Original WikiFree teaching text and synthetic fixtures are supplied for personal learning and adaptation with attribution. Provider lessons remain on their original sites and retain their own terms. No provider certificate is included.