Property (ii) — is increasing in the abandonment rate
ProvedErlangA.Abandonment.probAbandon_monotone_patienceerlang-amonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueing
Fix agents, an arrival rate and a service rate , and let be the steady-state abandonment probability of the Erlang-A queue with patience rate . Then
More impatient customers abandon more often. The paper quotes this property from Bhattacharya and Ephremides (1991) and uses it to compare the Erlang-A queue with the loss system obtained as .
Formalization Note "Increasing" is read as nondecreasing; the proof of Theorem 1 uses only this.
Preamble
import Mathlib import Definitions.Def_ErlangA_Abandonment_Model open Filter Topology
Formal statement
namespace ErlangA.Abandonment
/-- p. 223, property (ii): with `N`, `μ`, `λ` fixed, `P_N{Ab}` is (weakly) increasing in the
patience rate `θ > 0`. -/
theorem probAbandon_monotone_patience (N : ℕ) (hN : 1 ≤ N) (lam μ : ℝ)
(hlam : 0 < lam) (hμ : 0 < μ) :
MonotoneOn (fun θ : ℝ => probAbandon N lam μ θ) (Set.Ioi 0) := 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, property (ii) (from Bhattacharya and Ephremides 1991)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.