One grade partition, every schema it could run, and where each one dies

10
800
6

The pruning ladder

alive after each gate · bar is log scale

The 2-D map: web width × used width

every point is one schema. Green strip per web = chute band, W − 14 ≤ used ≤ W. Hover a point.
dead: wider than the webdead: > 7" trim/sidedead: score shaftsalive, by MSF/hr selected

Selected schedule

useful MSF/hr—
trim—
CIs · hours—

Run the schedule lineal feet along the machine · web centered · each rectangle is one sheet off its HQM knife · solid lines are slits, dashed are scores, orange across the web is the shear at an order change · scroll to zoom, drag to pan

120×
lineal feet0
elapsed0min
MSF produced0
current CI—
speed—fpm
web—

The orders in this partition

synthetic, one grade (C), generated from the seed · widths 16–52", cutoffs 18–80", three score depths

What this is and isn't. The enumeration, the chute band, the shaft bound, the dedup and the scores are the real gates from the scheduling-math ladder (L1–L5), with the machine constants from the plant-truth ledger; the speed model is the measured web-band curve, the short-cutoff haircut and the spread cliff. The master is a greedy cover of the ±10% window, sequenced widest-web-first, standing in for the CBC MIP with Dinkelbach the engine runs, so the schedule is good, not certified optimal. Run lengths follow the engine's L7 bound, r̄ = min over the schema's orders of 1.1·q / sheets-per-foot, and an order that can't be covered is listed, never dropped silently.