How to use mixed-length stock cutting plan
What this calculation does
A mixed-length cut plan assigns every listed part to identical measured stock while minimizing the number of boards under one kerf and trim rule.
Measure the stock first, enter each required cut once, then check the exact board-by-board assignment before cutting.
Enter the measurements
- Measured stock length: Measure the usable length of each stock board.
- Total end trim per board: Enter the end trim removed from every board.
- Kerf between consecutive parts: Measure the blade kerf used between adjacent parts.
- Required part lengths: List one required finished length on each line.
Formula and variables
For n pieces cut from one board, required length = sum(part lengths) + (n − 1) × kerf + end trim. An exact branch-and-bound search assigns every piece once and minimizes the stock-board count.
Each board must cover its assigned part lengths, one kerf between neighboring cuts, and the entered end trim. The search is exact and bounded to the stated part limit.
Read the result
Two boards are the minimum for these four parts; each board carries one 60 in part and one 30 in part, leaving 5.375 in after the declared kerf and trim.
Worked example
Inputs: 96 in stock, 0.5 in end trim, 0.125 in kerf and parts 60, 60, 30, 30 in
- Each 60 + 30 in pair uses 60 + 30 + 0.125 + 0.5 = 90.625 in.
- The remaining length is 96 − 90.625 = 5.375 in per board; four parts therefore fit in two boards.
Expected result: 2 boards; each takes 60 + 30 in parts and leaves 5.375 in
Frequently asked questions
Does the plan guarantee the grain or defect layout?
No. Grain, defects and board quality are not inputs; inspect each physical board before assigning cuts.
Can the result be approximate?
No approximate layout is labeled optimal. If the bounded exact search cannot prove a minimum, the calculation returns an error.
Conditions, presets and technical notes
One stock length, one kerf, one end-trim allowance per stock board, and at most 40 parts. The exact search has a bounded state budget and returns a clear error if it cannot prove the minimum; it never presents a heuristic layout as optimal. Defects and grain are excluded.
