Production Planning Model¶
Planning model — instantiates Constrained Resource Allocation
Plans how materials, labor, and machine time are spent across product lines, surfacing which resource is the binding bottleneck.
A factory holds several scarce resources at once — raw material, labor hours, machine time — and every product consumes a different mix of them. Production Planning Model decides how much of each product to make, and its defining move is to read the shadow value of each resource: once the plan is set, the model reports how much extra profit one more hour of a given machine, or one more ton of material, would unlock. That number tells you which single resource is the binding bottleneck governing throughput, and whether it is worth paying for overtime or expansion to relax it. This bottleneck-economics lens is what makes it a distinct sibling. Where others produce a distribution and stop, this model produces a distribution plus a price on each constraint, turning "we're at capacity" into "the paint booth is worth $340 an hour on the margin and nothing else is."
Example¶
A bicycle factory builds three models — a commuter, a trail bike, and a cargo bike — and can sell everything it makes. Each passes through frame-welding, painting, and final assembly, but in different proportions: the cargo bike hogs the paint booth, the trail bike leans on welding. The production planning model takes weekly capacities for each stage (the resource pools), the margin per bike (the objective), and the per-model consumption rates, then finds the product mix that maximizes total margin without exceeding any stage's hours.
The plan says: build mostly commuters and trail bikes, few cargo bikes. But the more useful output is the shadow values. Welding and assembly finish the week with slack — their shadow value is zero. The paint booth is fully used, and its shadow value comes back at roughly $340 per hour: an extra booth-hour would add that much margin. That single number reframes the plant manager's decision. Instead of debating the whole mix, the argument narrows to one question — is a weekend paint-booth shift, at its true cost, worth less than $340 an hour? Everything else is slack and not worth spending a dollar to expand.
How it works¶
- Inventory the resource pools and consumption. State each stage's available hours/materials and how much of each every product unit consumes.
- Optimize the mix against the objective. Find the product quantities that maximize total margin (or throughput) within all capacities at once.
- Read the shadow values. For each resource, extract the marginal margin of one more unit — zero for slack resources, positive for binding ones.
- Act on the bottleneck. Compare each binding resource's shadow value to the cost of adding capacity there; expand only where the value exceeds the cost.
Tuning parameters¶
- Objective choice — maximize margin, throughput, or on-time delivery. Each yields a different mix and a different bottleneck; margin favors high-value products, throughput favors volume.
- Planning bucket — the time granularity (shift, day, week). Fine buckets capture setup and sequencing but explode the model; coarse buckets are tractable but hide short-term bottlenecks.
- Setup/changeover treatment — whether switching a line between products costs time. Modeling it discourages fragmented runs but adds complexity and can turn the problem non-linear.
- Inventory carry allowance — how much may be built ahead and stored. More carry smooths bottlenecks across weeks but ties up cash and space.
- Shadow-value action threshold — how far a resource's shadow value must exceed expansion cost before you add capacity. A high threshold avoids over-building; a low one chases every marginal gain.
When it helps, and when it misleads¶
Its strength is that it does not just allocate — it prices the constraints, pointing precisely at the one resource whose expansion pays and sparing every other from wasted investment. That focus is the core of throughput thinking: in any linked process, one constraint governs the whole, and effort spent elsewhere is largely wasted.[n1]
Its failure mode is trusting shadow values built on stale or wrong inputs: the marginal price is only as good as the consumption rates and margins feeding it, and it is a local signal that holds only near the current plan — expand the bottleneck much and a different resource becomes binding, at a new shadow value the old number never predicted. The classic misuse is committing to a large capacity investment on a single-point shadow value, as if $340/hour held for a whole new shift when it may vanish after the first few hours. The guarding discipline is to treat shadow values as marginal and local: use them to rank where to look, re-solve after any real capacity change, and validate the binding rates with the people on the floor before spending.
How it implements the components¶
resource_pool— the several scarce stage capacities (welding, paint, assembly hours; materials) that constrain output.objective_function— the margin or throughput the mix is chosen to maximize.shadow_value_estimate— its signature: the marginal value of one more unit of each resource, naming the binding bottleneck.allocation_solution— the recommended product mix, delivered with the shadow-value read attached.
It does not enumerate an eligibility-screened candidate set — that framing belongs to Inventory Allocation Policy and Grant Allocation Review Protocol; nor does it maintain a running feedback loop like Capacity Allocation Rule.
Related¶
- Instantiates: Constrained Resource Allocation — the manufacturing instance, distinguished by pricing which resource constraint binds.
- Consumes: Linear Programming Solver — the solver computes both the optimal mix and the dual (shadow) values this model interprets.
- Sibling mechanisms: Budget Allocation Model · Staff Scheduling Model · Capacity Allocation Rule · Portfolio Allocation Model · Inventory Allocation Policy · Grant Allocation Review Protocol
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: Production Planning Model operates as an analytical, modeling, inference, comparison, or optimization procedure that derives insight or a solution because it plans how materials, labor, and machine time are spent across product lines, surfacing which resource is the binding bottleneck.
Independent corroboration: The frozen evidence defines Production Planning Model as 'Plans how materials, labor, and machine time are spent across product lines, surfacing which resource is the binding bottleneck', so its operative form is Analysis, Modeling & Optimization.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Operations Research
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Specialized
Rationale: Production Planning Model is most plausibly rooted in the operations_research tradition because its characteristic form depends on queueing, optimization, scheduling, prioritization, and constrained allocation. The assignment tracks that formative lineage, not the many settings in which the mechanism can now be applied.
Related originating lineages:
- Engineering & Design — The engineering_design tradition materially shaped Production Planning Model through its own practice of physical-system design, process control, reliability, and safety engineering.
- Logistics & Supply Chain Management — The logistics_supply_chain tradition materially shaped Production Planning Model through its own practice of staging, movement, sourcing, inventory, and endpoint fulfillment.
Review resolution: Both blind reviewers agree that operations research is the primary origin. Explicit reconciliation resolves alternate origin disagreement, origin mode disagreement. Formative alternate lineages are retained as engineering_design, logistics_supply_chain; later breadth of use is recorded separately as domain_reach=specialized, while origin_mode=cross_disciplinary_synthesis describes the relationship among origin lineages.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
[n1] The Theory of Constraints (Eliyahu Goldratt) holds that a linked production system's throughput is set by its single tightest constraint, so improvement effort should concentrate there until the bottleneck moves. Shadow values are the quantitative face of that idea: they price exactly how much the current bottleneck is worth relaxing. ↩