# Work backward from a fixed review checkpoint

Illustrative planning brief; no automatic product import.

Synthetic planning case: A finished proof is needed at model day ten. Layout takes three days, review two and final export one, with no overlap and all input ready at start.

## Decision

The chain must start no later than day four under this model: layout ends seven, review ends nine and export ends ten.

## Owned work

- Confirm the receiving finish boundary
  - Owner role: Proof receiver
  - Acceptance evidence: Day ten requires the exported accepted proof, not only completed layout.
- Subtract every required stage
  - Owner role: Scheduler
  - Acceptance evidence: Three, two and one model days appear in the backward plan.
- Verify readiness at latest start
  - Owner role: Delivery owner
  - Acceptance evidence: All inputs and resources are actually available by day four before treating it as a commitment.

## Workflow

1. Confirm the receiving finish boundary. Check: Day ten requires the exported accepted proof, not only completed layout.
2. Subtract every required stage. Check: Three, two and one model days appear in the backward plan.
3. Verify readiness at latest start. Check: All inputs and resources are actually available by day four before treating it as a commitment.

## Judgment

Backward arithmetic identifies a latest feasible model start, not a risk-adjusted or guaranteed delivery plan.


## Filled manual planning note

The chain must start no later than day four under this model: layout ends seven, review ends nine and export ends ten. Latest start=10−1−2−3=4. Backward windows preserve the required sequence and the fixed day-ten receiving checkpoint. Backward arithmetic identifies a latest feasible model start, not a risk-adjusted or guaranteed delivery plan.


## Workflow questions

### Is day four a safe start date?

Only within these deterministic assumptions; uncertainty or unavailable resources may require a different plan.

### Can I omit export because it is short?

No. The finish boundary requires it, and its one day is part of the chain.

## Product connection

Use the owned checks and downloaded brief to discuss this planning decision alongside your TeamBoostAI tasks. Confirm available fields, roles and account features separately. The example is manual; it does not calculate live analytics, create work or run an experiment in the product.

Confirm account availability before adopting this manual outline.

## Original worked case

Synthetic records, manual planning only. No account import or live analytics.

### Inspect the invented case records

Activity | Duration | Latest model window
--- | --- | ---
Layout | 3 days | Day 4–7
Review | 2 days | Day 7–9
Export | 1 day | Day 9–10

### Reasoning

Latest start=10−1−2−3=4. Backward windows preserve the required sequence and the fixed day-ten receiving checkpoint.

### Bounded result

The chain must start no later than day four under this model: layout ends seven, review ends nine and export ends ten.

### Distinct decision

This calculates a latest start from a stated receiving endpoint and complete sequential obligations.

### Limits

Backward arithmetic identifies a latest feasible model start, not a risk-adjusted or guaranteed delivery plan.

### Definitions and method context

- GAO Schedule Assessment Guide — https://www.gao.gov/products/gao-16-89g — General schedule-model context. All records, local policies and arithmetic are original toy examples, not a certified or optimized schedule.