Project scheduling is the process of defining project activities, sequencing them logically, estimating durations, and developing a timeline that predicts when work will be performed and completed. It sits at the heart of project management, driving resource allocation, cost control, and stakeholder communication. The Critical Path Method (CPM) revolutionized this field by identifying the longest sequence of dependent tasks that determines the minimum project duration—any delay on this path delays the entire project. What makes modern scheduling powerful is not just finding the critical path, but understanding float, dependencies, and variance tracking to dynamically adapt as conditions change, turning static plans into living, decision-ready models.
What This Cheat Sheet Covers
This topic spans 24 focused tables and 130 indexed concepts. Below is a complete table-by-table outline of this topic, spanning foundational concepts through advanced details.
Table 1: Network Diagram Types
| Method | Example | Description |
|---|---|---|
Boxes A → B → C with arrows between nodes | • Activities shown as nodes (boxes), arrows show dependencies • also called Activity-on-Node (AON) • supports all four dependency types. | |
Node contains: Task AES=0, EF=5LS=0, LF=5 | • Most common modern format where nodes represent activities and arrows represent logical relationships • simpler than AOA, no dummy activities needed. | |
Node 1 → (Activity A) → Node 2 | • Activities shown as arrows, nodes represent events/milestones • only supports finish-to-start dependencies • requires dummy activities for complex logic. |