| name | resource-constraint |
| description | Are resources sufficient? — Quantify compute, data, time, human, and financial resource constraints |
| version | 1.0.0 |
| category | experiment-execution |
| type | strategy |
| sops | ["resource-quantification","critical-chain-identification","buffer-sizing"] |
| tactics | ["sensitivity-ranking"] |
| dependencies | {"sops":["buffer-sizing","critical-chain-identification","resource-quantification"],"tactics":["sensitivity-ranking"]} |
Strategy: Resource Constraint
Methodology
Systematic resource feasibility assessment:
- Demand modeling: What does the experiment need?
- Supply inventory: What do we actually have?
- Gap analysis: Where does demand exceed supply?
- Critical chain: Which resource constraints lie on the critical path?
- Buffer sizing: How much slack do we need?
Resource categories:
| Category | Examples |
|---|
| Compute | GPU hours, CPU cores, memory, storage |
| Data | Training samples, labeled data, access rights |
| Time | Calendar time, researcher hours, review cycles |
| Human | Expertise, headcount, availability |
| Financial | Budget, cost per experiment, opportunity cost |
Execution Flow
-
Quantify Resources → call resource-quantification SOP
- Input: experiment plan, resource inventory
- Output: demand/supply/gap table per category
-
Identify Critical Chain → call critical-chain-identification SOP
- Input: task list with resource assignments
- Output: critical chain with resource contention points
-
Size Buffers → call buffer-sizing SOP
- Input: critical chain, task duration estimates
- Output: project/feeding/resource buffer recommendations
-
Rank Sensitivity → invoke sensitivity-ranking tactic
- Determine which resource gap is most binding
-
Report → synthesize feasibility assessment
- Go/No-Go/Conditional recommendation
Budget Gate
| Resource | Budget | Notes |
|---|
| Subagent calls | ≤6 | 3 SOPs + synthesis |
| Iterations | ≤2 | Re-quantify if estimates change |
| Output size | ≤3000 tokens | Gap table + recommendation |
Available Tactics
Optional, no fixed order; the final leaf is always a sop.
| Tactic | When to use |
|---|
| sensitivity-ranking | Rank constraints by sensitivity — which ones most impact the outcome if they shift |
Available SOPs
Optional, no fixed order; the final leaf is always a sop.
| SOP | When to use |
|---|
| buffer-sizing | Calculate project, feeding, and resource buffers — shared with implementation-planning |
| critical-chain-identification | Identify the critical chain — longest path considering resource contention |
| resource-quantification | Quantify resource demand vs supply vs gap for each resource category |