Eq. (3.8) — at every t > 0 the units in resupply are Poisson with mean λ∫₀ᵗ[1 − G(u)]du
ProvedServiceParts.Palm.units_in_resupply_poisson_finite_timep2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-processresupply
In the backorder system, started empty at time , let be the number of units in resupply at time and the resupply-time distribution function. For every and every ,
This is the finite-time law from which Palm's theorem follows by letting .
Preamble
import Mathlib import Definitions.Def_ServiceParts_Palm_ResupplySystem open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace ServiceParts.Palm
theorem units_in_resupply_poisson_finite_time {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
[IsProbabilityMeasure P] (S : ResupplySystem Ω P) {t : ℝ} (ht : 0 < t) (x : ℕ) :
(P {ω | S.unitsInResupply t ω = x}).toReal =
Real.exp (-(S.rate * ∫ u in (0 : ℝ)..t, (1 - S.resupplyCdf u))) *
(S.rate * ∫ u in (0 : ℝ)..t, (1 - S.resupplyCdf u)) ^ x / (Nat.factorial x : ℝ) := by sorry
end ServiceParts.Palm
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, pp. 40-41, Eq. (3.8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.