Critical Path Planning
Productivitycritical-path-planningCritical Path Planning is an Agent Skill for productivity published in the yogsoth-ai/de-anthropocentric-research-engine repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.
Identify the shortest execution path via CPM forward/backward pass, resource leveling, and buffer insertion
QUICK START
How to use this skill
Bring this guide into your coding agent with a prompt tailored to the tool you use.
- Open your project in Codex.
- Copy and paste the prompt below.
- Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/yogsoth-ai/de-anthropocentric-research-engine/blob/HEAD/skills/critical-path-planning/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/critical-path-planning, but wait for my approval before writing files or running scripts.
Copying this prompt does not install or run the skill. Review third-party files before use.
Strategy: Critical Path Planning
Key Question: What is the shortest path?
Methodology
Critical Path Method (CPM) adapted for experiment execution:
- Activity Listing — enumerate all implementation tasks
- Dependency Sequencing — determine predecessor/successor relationships
- Duration Estimation — three-point PERT (optimistic, most likely, pessimistic)
- Forward Pass — calculate earliest start/finish for each activity
- Backward Pass — calculate latest start/finish, identify zero-float path
- Resource Leveling — resolve resource conflicts on parallel paths
- Buffer Insertion — add project buffer (Critical Chain method) at convergence points
Execution Flow
activity-listing
→ dependency-sequencing
→ duration-estimation
→ critical-path-calculation
→ [resource leveling if conflicts]
→ [buffer insertion]
→ OUTPUT: annotated task graph with critical path highlighted
Budget Gate
| Step | Max Budget | Output |
|---|---|---|
| Activity listing | 5% | Complete activity list |
| Dependency + Duration | 10% | Sequenced, estimated network |
| CPM calculation | 5% | Critical path + float table |
Key Decisions
- If critical path is too long: look for fast-tracking (parallel execution) or crashing (more resources)
- If resource conflicts exist: prioritize critical path tasks over float tasks
- Buffer size: typically 50% of critical chain duration (Goldratt's recommendation)
Available Tactics
Optional, no fixed order; the final leaf is always a sop.
| Tactic | When to use |
|---|---|
| task-decomposition | Orchestrate the breakdown of experiment design into sequenced, estimated, and formatted task plan |
Available SOPs
Optional, no fixed order; the final leaf is always a sop.
| SOP | When to use |
|---|---|
| activity-listing | Enumerate all implementation activities from an experiment design |
| critical-path-calculation | CPM forward/backward pass with float calculation to identify the critical path |
| dependency-sequencing | Determine task dependencies and execution order |
| duration-estimation | Three-point PERT estimation for implementation activities |