Proof of Theorem 1 — agent utilization below one:
ProvedErlangA.Abandonment.utilization_lt_oneerlang-ap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingutilization
Consider the Erlang-A queue with agents, arrival rate , service rate and patience rate , and let be the steady-state probability that an arriving customer abandons. Then
The left side is the rate at which work reaches the agents and the right side the maximal rate at which they can process it, so the inequality says that the agents' utilization is strictly below one. In the proof of Theorem 1 it yields the lower bound .
Preamble
import Mathlib import Definitions.Def_ErlangA_Abandonment_Model open Filter Topology
Formal statement
namespace ErlangA.Abandonment
/-- App. C, proof of Theorem 1, p. 223, first display: the agents utilization is below one,
`λ (1 − P{Ab}) < Nμ`. -/
theorem utilization_lt_one (N : ℕ) (hN : 1 ≤ N) (lam μ θ : ℝ)
(hlam : 0 < lam) (hμ : 0 < μ) (hθ : 0 < θ) :
lam * (1 - probAbandon N 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, first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.