Theorem 9 — delayed due dates: units in resupply for at least T are compound Poisson with parameter λτ̄α
ProvedServiceParts.Palm.delayed_due_datesConsider the compound Poisson backorder system of Theorem 7 (Poisson orders with rate , i.i.d. order sizes with law , one common resupply time per order with density , distribution function and finite mean , all mutually independent, empty at time ). Fix a due-date delay and let be the number of units in resupply at time each of which has been in the resupply system for at least time units. Put
Then for every
where is the probability that customers generate a total demand of units.
For , and this is Theorem 7. When each demand must be met within time units of its arrival rather than immediately, counts the units whose demand is due, which is what the stock level has to cover.
Formalization Note "Steady state probability" is pinned to for the system empty at time . An order placed at counts when . The mean resupply time is positive (the resupply time has a density), so is well defined.
import Mathlib import Definitions.Def_ServiceParts_Palm_ResupplySystem import Definitions.Def_ServiceParts_Palm_CompoundResupplySystem open MeasureTheory ProbabilityTheory Filter Topology
namespace ServiceParts.Palm
theorem delayed_due_dates {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
[IsProbabilityMeasure P] (S : CompoundResupplySystem Ω P) {T : ℝ} (hT : 0 ≤ T) (n : ℕ) :
Tendsto (fun t : ℝ => (P {ω | S.agedUnitsInResupply T t ω = n}).toReal) atTop
(𝓝 (compoundPoissonPMF
(S.rate * S.meanResupply *
((1 / S.meanResupply) * ∫ u in Set.Ioi T, (1 - S.resupplyCdf u)))
S.sizePMF n)) := by sorry
end ServiceParts.Palm
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.