Critical-Path Planning and Scheduling: Mathematical Basis¶
Kelley. (1961). Critical-Path Planning and Scheduling: Mathematical Basis: Mathematical Basis. Operations Research.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Topological Sorting
- Build systems (make, Bazel, npm, pip, Cargo) run topological sort over package or compilation dependency graphs to determine build order; spreadsheet recalculation engines linearize formula-dependency DAGs the same way; database schema migration tools order migration files by their declared dependencies; compilers schedule instruction emission and resolve link-time symbol dependencies; curriculum planners linearize course prerequisite graphs into semester sequences; PERT/CPM project scheduling linearizes task dependency networks and surfaces the critical path — the longest chain, which lower-bounds total duration and identifies which tasks have no schedule slack.
This sourceEstablishes the Critical-Path Method as a scheduling technique whose model incorporates sequence information, durations and costs for each project activity.
Supported in partVerified against the publisher's abstract
“The essential ingredient of the technique is a mathematical model that incorporates sequence information, durations, and costs for each component of the project.”
- Build systems (make, Bazel, npm, pip, Cargo) run topological sort over package or compilation dependency graphs to determine build order; spreadsheet recalculation engines linearize formula-dependency DAGs the same way; database schema migration tools order migration files by their declared dependencies; compilers schedule instruction emission and resolve link-time symbol dependencies; curriculum planners linearize course prerequisite graphs into semester sequences; PERT/CPM project scheduling linearizes task dependency networks and surfaces the critical path — the longest chain, which lower-bounds total duration and identifies which tasks have no schedule slack.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:2f74ddf0cb37 · see in the full table