Proof of Theorem 1 — for every
ProvedErlangA.Abandonment.probAbandon_le_erlangerlang-aerlang-bp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing
For agents, arrival rate , service rate and any patience rate , the steady-state abandonment probability of the Erlang-A queue is at most Erlang's blocking probability of the loss system with the same , , :
This is the comparison that turns asymptotics of Erlang's formula into the upper bound of Theorem 1.
Preamble
import Mathlib import Definitions.Def_KellyStochasticNetworks_Erlang import Definitions.Def_ErlangA_Abandonment_Model open Filter Topology
Formal statement
namespace ErlangA.Abandonment
/-- p. 223: `P_N{Ab} ≤ P_N{Bl}` for every patience rate `0 < θ < ∞`. -/
theorem probAbandon_le_erlang (N : ℕ) (hN : 1 ≤ N) (lam μ θ : ℝ)
(hlam : 0 < lam) (hμ : 0 < μ) (hθ : 0 < θ) :
probAbandon N lam μ θ ≤ KellyStochasticNetworks.erlang (lam / μ) N := by sorry
end ErlangA.Abandonment
Source
Garnett, Mandelbaum & Reiman, Designing a Call Center with Impatient Customers, M&SOM 4(3), 2002, p. 223, Appendix C, proof of Theorem 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.