EOQCalculator.com
Wilson EOQ, with the math
Playbook

EOQ vs Wagner-Whitin: time-varying demand

By Oliver Wakefield-Smith, Founder, Digital Signet
Direct answer

Wilson assumes constant demand D. When demand is known but lumpy across time buckets (typical MRP setting), Wagner-Whitin dynamic programming finds the cost-optimal lot plan and routinely improves on EOQ by 5 to 15 percent. Silver-Meal is the standard heuristic when DP is overkill[1].

Why Wilson fails on lumpy demand

Wilson averages annual demand and assumes the cycle repeats. If your MRP buckets show 50, 50, 200, 0, 50, 50 units across six weeks, an annualised D smears the 200-unit spike across the year. The right answer is often to order ahead of the spike, batch the small weeks together, and skip the zero week. Wilson cannot represent that.

Wagner-Whitin recursion
F(t) = min over j in 1..t of [ F(j-1) + S + H * sum_{k=j..t}(d_k * (k - j)) ]
Optimal cost to cover periods 1 through t, deciding the last order placement j.

Silver-Meal heuristic

Silver-Meal computes the average period cost if you cover periods j through j+k with one order. Stop when adding another period raises the average. Near-optimal in practice and a fraction of the DP compute. Most ERPs implement it as the default lot-sizing rule when the planner picks "least period cost."[2]

When to use which