PM ‐ Lec 4 - RenadShamrani/test GitHub Wiki

Lecture 4: Project Network Scheduling Technique

Simplified with Emojis & Mind Maps!

1. Project Network

  • 📊 Tool: Used to plan, schedule, and monitor progress.
  • 🔗 Activities: Tasks with start & finish times.
  • ⏳ Critical Path: Longest path that determines project duration.

2. Network Computation

  • ➡️ Forward Pass: Calculate Early Start (ES) & Early Finish (EF).
    • Formula: EF = ES + Duration.
  • ⬅️ Backward Pass: Calculate Late Start (LS) & Late Finish (LF).
    • Formula: LS = LF - Duration.
  • ⏸️ Slack: Time an activity can be delayed without affecting the project.
    • Formula: Slack = LS - ES or LF - EF.

3. Activity Relationships

  • 🔗 Finish-to-Start (FS): Task B starts after Task A finishes.
  • 🔗 Start-to-Start (SS): Task B starts when Task A starts.
  • 🔗 Finish-to-Finish (FF): Task B finishes when Task A finishes.

4. Critical Path

  • 🚨 Key Path: Longest path with zero slack.
  • ⚠️ Importance: Delays here delay the entire project.

Mind Map Recap

Project Network Scheduling  
├── Network (📊🔗⏳)  
├── Computation (➡️⬅️⏸️)  
├── Relationships (🔗)  
└── Critical Path (🚨⚠️)

Key Takeaway:

Use project networks to plan tasks, calculate timelines, and identify the critical path! 🚀