0% found this document useful (0 votes)
69 views10 pages

Queuing Theory P4

1. The average number of customers in the system is equal to the average arrival rate multiplied by the average time spent in the system. 2. The average waiting time in the queue is equal to the average number of customers in the queue divided by the average arrival rate. 3. The probability that an arrival has to wait is equal to the probability that there are already c or more customers in the system.

Uploaded by

Akash Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
69 views10 pages

Queuing Theory P4

1. The average number of customers in the system is equal to the average arrival rate multiplied by the average time spent in the system. 2. The average waiting time in the queue is equal to the average number of customers in the queue divided by the average arrival rate. 3. The probability that an arrival has to wait is equal to the probability that there are already c or more customers in the system.

Uploaded by

Akash Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

5

lit%e
Z o

IV
Theory
Queueing
e
Queueing
Probability and
,
systemis L,
customers in the
2. Average number of
[Little's formula)

cc! 1—

queue is Wq •
time of a customer in the
3. Average waiting

l.c. c! 1—

ws
in the system is
4. Average waiting time • We have Lg
c.c!1-

l.c„c! 1
c.c!

to wait (ie busy system)


5. Probability that an arrival has
4.04 4 65
Probabilityand Queueing Theos *Queueing Theory o

6. Probability that an arrival enters the


service without
waiting (ie idle system) is

= I-P(N2c) =

7. Average number of customers in a non-emptyqueue is


Average number of customers in the queue
Probability of non—emptyqueue

c.c! 1 —

Mean waiting times in the queue for those who actually


[from(1)) wait is E > O)

and E [W / W > 01

8. Probability that some one will be waiting is P(N

and P (N 2 c + l) = Pn

(from (1))

10. Efficiency of MIMIC model


Average number of customers served
Total number of customers
·6
7 ·3
· 4·2
·P

1. the an S. 1. 一


rate average
mple U
~
Average Average Average Average Average First busy

of 1
find …
3 一0
0
fraction
15 0 一
冖 There waiting
number
arrival
p
factor
number
waiting length
6
letters p

of are
0 一
0 of
has

0
0 ~
time per
the
cu the

t) 0
hour•

0
queue
hour. ome S
、0
P 0m0 system
the
一 (N
w " U
M
s
Ⅳ in in P(N MARY 、
0 、
"
typist
in

~
一 L
0 c)
0
W
、 Ⅳ 00~
will rs Office.
arrive
30n
0
一 ~
time
·P
useful. mp
W em and
Each 十 is
0
b

、 | L

Queueing

000
2
[AU
being q
2011,

typed
can
c)
2012)

0

0 0


Now
being
" P There
d
22
·25 a

e

2
× 15
3
typists•
3
22
·25 + =
” 冖
2
·5 2
0
·0 一
0 …
5 冖
A.U
9 ·284
2
·289
2
0

467
3. ~. 4.

日 Waiting 一
0品Average
e
) (h
is
time 0「0
But the=
m
Ws 一
=
the
L queue
0
3.508 W 0』

5 18 3 0
L. 「

0
0 (0.7 ー 15 x “
十日 6

1 1 (一
.0.
日 15 ー15 wa 15.6

P「
) 6) X 15・ P 一
= 6 3 Oba
0m0 Ⅱ 0.7016
x (N 品
0.7016 x P

3.508 Ⅳ 一
0 0.0
0
= c)

= 9 0 0=
0
0
一 “ 」
Que
=
0 00 0.7016
=
0 =0
十 (

=一
=
0

オ 0
03
0 「

・ 一
】 ・
Service Solution0三 「 日
(i) 0 (
三0
Example
counters.
&
MIMICtypec 一
0 目 0

ti
日「
一 1
当 per 0
】 e
a a 日 2
2 customer 一 hour.一
口 一
1 2 exponential TWO is u一 「 】
0 the A 8
the the
coun supermarket
andsemce ・
probability
expected
日 【 has
若 2, e「 一
「 Ⅱ

5 ぎ P00
h 0 wait, 日 0. P23
2 percentage 「 e 24 0.

e Ⅱ WO 【 0 一
0 「 has 日 自 き
05
having arnor
目 「
10 semce what inu 5
x hours +
" pe 一
0 each 【 60 0.1
4 4
per
is 0 一 0 )
。 日

( = gi 月 minutes ま
hou PO the 「
idle 0 a customer
ュ 6
ill 日 mute wait PO s
に 「 ぎ 一 一
y.
【 S M.
【 一 running
U. c time 「 0 目
97 窄 「
一 for service「 is
per ()U length h exponential
up

each on
mrnutc
0 一
08 0
「 girl . 岳
言 き 0 with 4
0 ・
~ rate 0 ト
に 三

9
一 代

4 6 6 0 0 曾 曾
IV

0
: 二丶丶

一30

depositsaud · ~、
When
When
Wc 74
T1, Average
Average

he 0
mo
T
、 14 0
do is
|
0
warung
r, separate 一
waiting

bo
冖 " 、 丶
、rmu
h
,
|
6 time
"

o
20
tune

× 、 queue |
8 60 20 for
|
14

12 | 4
there mmutes ×
10
withdrawals
fo min
60 20
deposit

、 u 20
are |
3
withdrawal
tes. minutes | 0
「 16
0 7

service
is
000
min is
channels.
utes.
ate 丶
2

same) ra

e

We
0
·0
Model
~

,十 1

| n ·Il 20


"
十 0
30

2!

… is
PO

on
vanable

with
4.70 e Probability and Queueing 77teory« 4.77
e
Theory
Average waiting time for a customer is

BC-A ow
c!

pc-I c! 1- 7 49

40 - 30
4 + 7 + 49 - (15)-1
-15

.. The average waiting time is


_= —x X— hrs
10 5 7

X 60 minutes.
10 pc —A
= 3.86 minutes

Hence if both tellers do both types of service, the waitingtime is


reduced considerably and so the customers are benefitted. pc—I c! 1-

Now, if the tellers do both type of services by increasing thé


service time from 3 to 3.5 minutes, then

60 15
- 2, 1 = 30/hr, = / min= / hr —x 2-30
3.5 3.5 3.5
49
30 3.5
60 15
60 x 2 - 30
3.5
ülo

You might also like