Overall Planning Method
Updated 2026-08-22
INTRODUCTION
English translation pending.
CORE DEFINITION
The overall planning method, popularized in China by the mathematician Hua Luogeng, applies network analysis to the coordination of multiple tasks. It lists the operations and their dependencies, draws them as a network, identifies the critical path whose length determines the total duration, and uses the slack on non-critical paths to reallocate resources. The core proposition is that total project duration is set by the longest dependent chain rather than by the sum of all work, so shortening a non-critical task cannot shorten the project while shortening a critical one can. The key qualification is that the analysis is only as good as the dependency map, since one missed dependency invalidates the schedule.
SCAFFOLDING EFFECT
Reduce cognitive load
- Dependency map: list every operation and what must finish before it can start. - Critical path find: identify the longest chain, which sets the total duration. - Slack use: move resources from paths with slack onto the critical one.
Anchor fast decisions
Operations on the longest dependent chain run back to back, so their durations add directly to the finish date, while operations elsewhere have idle time. Compressing or accelerating a critical operation shortens the whole project, whereas accelerating anything else changes nothing. Concentrating resources on the critical path therefore converts the same effort into a shorter schedule.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E7%BB%9F%E7%AD%B9%E6%96%B9%E6%B3%95%E5%B9%B3%E8%AF%9Dverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS