HP 12C#ABA hp 12c_solutions handbook_English_E.pdf - Page 164

Queuing and Waiting Theory, Graduated Payment Mortgage, Average number of customers in queue.

Page 164 highlights

Queuing and Waiting Theory • n = number of servers. • λ = arrival rate of customers (Poisson input). • µ = service rate for each server (exponential service). • ρ = Intensity factor n for valid results). • P0 = Probability that all servers are idle. • Pb = Probability that all servers are busy. • Lq = Average number of customers in queue. • L = Average number of customers in the system (waiting and being served). • Tq = Average waiting time in queue. • T = Average total time through the sytem. • P(t) = Probability of waiting longer than time t. • P0 = -1 n-1 ∑k = 0 -ρk---!k- + n---------- n!   1 - n-ρ- • Pb = ------ρ---n---P-----0-----n!1 - n-ρ- • • Lq = -n-ρ---P-----b-ρ-- L = Lq + ρ T = L / λ Tq = L--λ--q- • P(t) = Pbe-(nµ - λ)t Graduated Payment Mortgage 163

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82
  • 83
  • 84
  • 85
  • 86
  • 87
  • 88
  • 89
  • 90
  • 91
  • 92
  • 93
  • 94
  • 95
  • 96
  • 97
  • 98
  • 99
  • 100
  • 101
  • 102
  • 103
  • 104
  • 105
  • 106
  • 107
  • 108
  • 109
  • 110
  • 111
  • 112
  • 113
  • 114
  • 115
  • 116
  • 117
  • 118
  • 119
  • 120
  • 121
  • 122
  • 123
  • 124
  • 125
  • 126
  • 127
  • 128
  • 129
  • 130
  • 131
  • 132
  • 133
  • 134
  • 135
  • 136
  • 137
  • 138
  • 139
  • 140
  • 141
  • 142
  • 143
  • 144
  • 145
  • 146
  • 147
  • 148
  • 149
  • 150
  • 151
  • 152
  • 153
  • 154
  • 155
  • 156
  • 157
  • 158
  • 159
  • 160
  • 161
  • 162
  • 163
  • 164
  • 165

163
Queuing and Waiting Theory
n
= number of servers.
λ
= arrival rate of customers (Poisson input).
µ
= service rate for each server (exponential service).
ρ
= Intensity factor =
λ
/
µ
(
ρ
,
n
for valid results).
P
0
= Probability that all servers are idle.
P
b
= Probability that all servers are busy.
L
q
= Average number of customers in queue.
L
= Average number of customers in the system (waiting and being
served).
T
q
= Average waiting time in queue.
T
= Average total time through the sytem.
P
(
t
) = Probability of waiting longer than time t.
P
(
t
) =
P
b
e
-
(
n
µ
-
λ
)
t
Graduated Payment Mortgage
P
0
ρ
k
k
!
-----
k
0
=
n
1
ρ
n
n
!
1
ρ
n
--
-----------------------
+
1
=
P
b
ρ
n
P
0
n
!
1
ρ
n
--
-----------------------
=
L
q
ρ
P
b
n
ρ
------------
=
L
L
q
ρ
+
=
T
q
L
q
λ
-----
=
T
=
L
/
λ