# Find the path that drives a toy schedule

Illustrative planning brief; no automatic product import.

Synthetic planning case: A toy production network has branch A: brief two days then artwork four; branch B: data preparation three days. Both branches must finish before one day of final assembly.

## Decision

With independent resources and all inputs ready at day zero, branch A drives the seven-day earliest finish. Shortening branch B alone does not shorten that finish.

## Owned work

- Verify the network edges
  - Owner role: Planning owner
  - Acceptance evidence: Assembly requires both completed branches, with no missing input edges.
- Compare branch lengths
  - Owner role: Scheduler
  - Acceptance evidence: Six days to artwork exceeds three days to data under the supplied durations.
- Target the driving condition
  - Owner role: Delivery lead
  - Acceptance evidence: Any finish-shortening proposal changes the six-day branch or assembly, with resources rechecked.

## Workflow

1. Verify the network edges. Check: Assembly requires both completed branches, with no missing input edges.
2. Compare branch lengths. Check: Six days to artwork exceeds three days to data under the supplied durations.
3. Target the driving condition. Check: Any finish-shortening proposal changes the six-day branch or assembly, with resources rechecked.

## Judgment

Resource contention, missing dependencies and duration uncertainty are excluded. A model earliest finish is not a promised date.


## Filled manual planning note

With independent resources and all inputs ready at day zero, branch A drives the seven-day earliest finish. Shortening branch B alone does not shorten that finish. Branch A reaches the merge after 2+4=6 days; B after three. Assembly starts at max(6,3)=6 and finishes at day seven. Resource contention, missing dependencies and duration uncertainty are excluded. A model earliest finish is not a promised date.


## Workflow questions

### Why not add both branches?

They are parallel with separate resources in this example; the merge waits for the later branch.

### Does seven days predict actual delivery?

No. It is a deterministic result of invented durations, complete inputs and the stated resource assumptions.

## 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 in model days | Predecessor
--- | --- | ---
Brief | 2 | Start
Artwork | 4 | Brief
Data preparation | 3 | Start
Assembly | 1 | Artwork and data

### Reasoning

Branch A reaches the merge after 2+4=6 days; B after three. Assembly starts at max(6,3)=6 and finishes at day seven.

### Bounded result

With independent resources and all inputs ready at day zero, branch A drives the seven-day earliest finish. Shortening branch B alone does not shorten that finish.

### Distinct decision

This identifies the finish-driving path in a complete toy network, beyond describing a dependency handoff.

### Limits

Resource contention, missing dependencies and duration uncertainty are excluded. A model earliest finish is not a promised date.

### 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.