Sect. 13.2.4.3: balanced ordering, for
ProvedSupplyChainTheory.batch_balanced_orderingbullwhip-effectoperations-researchprobabilitysupply-chain
Suppose the retailers' orders are spread evenly over the -period interval: writing with , of the daily groups have retailers and the other have , so the number of retailers ordering on a given day is with probability and with probability . Then the total order received by the supplier satisfies
with equality when , that is when exactly the same number of retailers orders on each day. Balancing is the mildest of the three patterns and is the strategy the book recommends when batching cannot be avoided.
Preamble
import Definitions.Def_SupplyChainTheory_bullwhip
Formal statement
namespace SupplyChainTheory
theorem batch_balanced_ordering {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
[MeasureTheory.IsProbabilityMeasure P] {N R : ℕ} {mu sigma : ℝ} (hR : 0 < R)
(B : BatchOrders P N R mu sigma) (M k : ℕ) (hk : k < R) (hN : N = M * R + k)
(hXM : P.real {ω | B.X ω = M} = 1 - k / R)
(hXM1 : P.real {ω | B.X ω = M + 1} = k / R) :
(∫ ω, B.supplierOrder ω ∂P) = N * mu
∧ ProbabilityTheory.variance B.supplierOrder P
= N * sigma ^ 2 + mu ^ 2 * k * (R - k) := by sorry
end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, pp. 550-551, Sect. 13.2.4.3 'Balanced Ordering'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.