












































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
In the following Lecture Notes of Business Management, the Lecturer has illustrated these points in detail : Service Engineering, Quality, Efficiency Driven, Contact Centers, Background, Operational Regime, Dimensioning, Statistical Analysis, History, Methods of Judging
Typology: Study notes
1 / 52
This page cannot be seen from the preview
Don't miss anything!













































in an M/M/N (Erlang-C) world
Dimensioning:
Erlang-C = M/M/N
arrivals (^) queueACD
agents
Offered load R =! " E(S)
= 400 " 3:45 = 1500 min./30 min. = 50 Erlangs
Occupancy # = R/N
= 50/100 = 50%
Quality-driven : 100 agents, 50% utilization
$ Can increase offered load - by how much?
Erlang-C N=100 E(S) = 3:45 min.
Quality-driven : 100 agents, 50% utilization
$ Can increase offered load - by how much?
Erlang-C N=100 E(S) = 3:45 min.
1400 87.5% 0:02 min. 88% 1550 96.9% 0:48 min. 35% 1580 98.8% 2:34 min. 15% (^1585) 99.1% 3:34 min. 12%
Changing N ( Staffing ) in Erlang-C
E(S) = 3: !/hr N^ OCC^ ASA^ % Wait = 0 1585 100 99.1% 3:34 12%
Changing N ( Staffing ) in Erlang-C
E(S) = 3: !/hr N^ OCC^ ASA^ % Wait = 0 1585 100 99.1% 3:34 12% 1599 100 99.9% 59:33 0%
Changing N ( Staffing ) in Erlang-C
E(S) = 3: !/hr N^ OCC^ ASA^ % Wait = 0 1585 100 99.1% 3:34 12% 1599 100 99.9% 59:33 0% 1599 100+1 98.9% 3:06 13% 1599 102 98.0% 1:24 24% 1599 105 95.2% 0:23 50%
$ New Rationalized Operation
Efficiently driven, in the sense that OCC > 95%; Quality-Driven, 50% answered immediately
Economies of Scale in a Frictionless Environment
Above: R = 100, N = R + 5, 50% delayed.
, Safety-Staffing N = &R + 0 R ' , 0 > 0.
Consider a sequence of M/M/N models, N=1,2,3,…
Then the following 3 points of view are equivalent:
1 Customer (^) N N lim^ P
1 Server N lim+ 2 N ( 1 - # (^) N ). 0 , 0 < 0 < 2 ;
1 Manager N % R ) 0 R , R. !" E(S) large;
Here
1 (^1) ( )
(^45)
3 0 h ,
where h (,) is the hazard-rate of standard-normal.
Extremes: Everyone waits : 3. 1 8 0. 0 Efficiency-driven
No one waits : 3. 0 8 0. 2 Quality-driven
1
19
Beta
Alpha
Q Q+
0 1 2 N-1 (^) N N+
Q(0) = N : all servers busy, no queue.
Recall E 2 ,N =
[ 1 + TTNN,N^ −^1 −,N 1
[ 1 + (^) ρN^1 E^ − 1 ,NρN − 1
]− 1 .
Here TN − 1 ,N = (^) λN E^11 ,N − 1 ∼ (^) N μ × h(^1 −β)/√N ∼ (^) h(−^1 β/μ)√N which applies as √N (1 − ρN ) → β, −∞ < β < ∞. Also TN,N − 1 = (^) N μ(1^1 − ρN ) ∼ (^) β^1 √/μN which applies as above, but for 0 < β < ∞. Hence, E 2 ,N ∼
[ 1 + (^) h(−ββ)
]− 1 , assuming β > 0.
QED: N ∼ R + β√R for some β, 0 < β < ∞ ⇔ λN ∼ μN − βμ√N ⇔ ρN ∼ 1 − √βN , namely (^) Nlim →∞√N (1 − ρN ) = β.
Theorem (Halfin-Whitt, 1981) QED ⇔ (^) Nlim →∞E 2 ,N =
[ 1 + (^) h(−ββ)
]− 1 .
6