Inferensys

Glossary

ATP Netting

ATP Netting is the core calculation logic that subtracts gross demand requirements from scheduled receipts and on-hand inventory to compute the projected available balance for order promising.
Technical lab environment with sensor equipment and analytical workstations.
CORE CALCULATION LOGIC

What is ATP Netting?

ATP netting is the fundamental arithmetic engine that computes the projected available balance by sequentially subtracting gross demand from scheduled supply within a defined time horizon.

ATP netting is the core calculation logic that determines the projected available balance of inventory by subtracting gross demand requirements from scheduled receipts and on-hand stock within each time bucket. The process runs sequentially across the ATP horizon, consuming supply to satisfy demand and generating a net availability figure that the order promising engine uses to commit delivery dates.

The netting calculation respects the demand time fence (DTF), where actual customer orders fully consume the forecast, and applies sourcing rules to prioritize which supply elements are consumed first. A negative projected balance signals a potential stockout, triggering exception alerts for planners to expedite supply or reallocate inventory before the capable-to-promise check fails.

THE NETTING LOGIC ENGINE

Core Characteristics of ATP Netting

ATP Netting is the fundamental arithmetic engine of order promising. It executes a time-phased subtraction of gross demand from total supply to generate the projected available balance, which serves as the single source of truth for real-time commitments.

01

The Netting Equation

The core calculation follows a strict time-phased sequence: Projected Available Balance (PAB) = Prior Period PAB + Scheduled Receipts - Gross Demand. This equation runs bucket-by-bucket across the ATP Horizon. If PAB drops below zero, the system flags a potential stockout. The calculation respects the Demand Time Fence (DTF) , where actual orders consume the forecast, preventing double-counting of requirements.

02

Supply & Demand Buckets

Netting logic aggregates data into discrete time buckets. Supply includes:

  • On-hand inventory
  • Open purchase orders (In-Transit Inventory)
  • Firm planned production orders
  • Safety Stock (treated as untouchable demand)

Demand includes:

  • Sales orders (hard demand)
  • Forecast (soft demand, consumed inside the DTF)
  • Inter-plant transfers
  • Safety stock requirements
03

Cumulative vs. Period Netting

Two distinct methodologies exist:

Periodic Netting: Calculates PAB strictly within a single time bucket. Excess supply in one period does not automatically cover a shortage in the next.

Cumulative ATP: Sums available supply across multiple periods. A large order can be promised against the total supply available over a future timeframe, enabling bulk order commitments without splitting. This is critical for Global ATP checks across a network.

04

Pegging & Traceability

Netting is intrinsically linked to pegging. Demand Pegging traces a specific supply receipt (e.g., a PO) to the exact sales order consuming it. Supply Pegging performs the reverse, linking a customer order to its fulfilling supply elements. This bidirectional traceability enables impact analysis: if a supplier delays a shipment, the system instantly identifies every customer order at risk, triggering Backorder Processing or re-promising workflows.

05

Constraint Integration

Basic netting assumes infinite capacity. Constraint-Based ATP extends the logic by feeding the netting output into a constraint solver that simultaneously evaluates:

  • Material availability (from netting)
  • Finite Capacity Scheduling of work centers
  • Transportation lane capacities

If a resource bottleneck is detected, the solver iteratively adjusts the promise date. This contrasts with Rule-Based ATP, which applies a static sequence of sourcing rules without dynamic capacity validation.

06

Real-Time Re-Netting Triggers

The netting calculation is not a static batch job. Modern Order Promising Engines re-execute netting in real-time when:

  • A new sales order is placed
  • A purchase order receipt is confirmed
  • A production order is completed or delayed
  • Safety Lead Time buffers are consumed

This continuous re-netting ensures the Projected Available Balance always reflects the current state, enabling accurate Order Reservation and preventing overselling.

ATP NETTING EXPLAINED

Frequently Asked Questions

Clear, technical answers to the most common questions about the core calculation logic that drives Available-to-Promise commitments.

ATP Netting is the core calculation logic that subtracts gross demand requirements from scheduled receipts and on-hand inventory to compute the Projected Available Balance (PAB) for a given period. The process operates sequentially across the ATP Horizon, starting with current on-hand inventory. In each time bucket, the system first adds any scheduled receipts—such as open purchase orders, firm planned orders, or in-transit shipments—to the beginning balance. It then subtracts gross demand, which includes sales orders, safety stock requirements, and forecast consumption. The resulting balance becomes the opening inventory for the next period. If the PAB falls below zero, the system flags a potential stockout and may trigger a planned order release to restore availability. This netting logic is the mathematical engine behind every Order Promising Engine, ensuring that commitments are made against real, unallocated supply rather than theoretical inventory positions.

ORDER PROMISING LOGIC COMPARISON

ATP Netting vs. Related Calculation Methods

A technical comparison of the core calculation logic, inputs, and constraints evaluated by different order promising methods.

FeatureATP NettingCapable-to-Promise (CTP)Profitable-to-Promise (PTP)

Primary Objective

Calculate projected available balance to commit inventory

Validate production capacity and material availability

Maximize margin by evaluating fulfillment cost vs. revenue

Core Calculation Logic

Subtracts gross demand from scheduled receipts and on-hand inventory

Explodes BOM and routes against finite capacity schedules

Applies cost-to-serve model against customer lifetime value

Key Input Data

On-hand inventory, scheduled receipts, gross demand

BOM, routings, work center calendars, material availability

Freight costs, labor, margin, customer segment profitability

Evaluates Capacity

Evaluates Material Constraints

Evaluates Financial Viability

Primary Time Horizon

Short-term (days to weeks)

Medium-term (weeks to months)

All horizons

Typical Response Latency

< 1 sec

1-5 sec

2-10 sec

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.