Queuing Model Opm

system willbecome predictable, b03
of the has reached When this state is

that the system steady state. reached, we can say
All the following
discussions
based on the assumption that tthe
on solving
system problems
in
is under queuing theory are
steady state.
7.8 NOTATIONS USEDIN QUEUING
A= Mean (or
Average)
(i.e., average
SYSTEM
arrived rate
mean (or number of arrivals per unit of
Average) service rate
(i.e., average
time)
number customers serviced per unit
p=Traffic intensity time)
(when there is only one
server)
(when there are multiple
servers, where 'd refers to the
number of servers).
Note: When 'p' is more than 1.00, the
system will not be successful and
will finally collapse. When 'p'is less than 1.00,
O, = Probability that the system can work
or at the server)
there is no one in the system (in efficiently.
the queue
P,= Probability that the service
that the customer has to waitfacility is busy (which implies
in the queue)
p. = Probability that there are n'
customers in the
q=Average number of customersin the queue [Alsosystem.
Length or Expected number of customers in thecalled Queue
L,=Average number of customersin the system (i.e., inqueue]
the queue
+ at the service counter)
W,=Average waiting time in the queue
W, =Average waiting time in the system
S
P=Probability density function of waiting time [i.e., probability

that a customer shall have to wait between time t, &t,).
1.9 STANDARD QUEUING MODELS
le notation is widely followed for representing queuing models.
Aqueuing model is completely specifed in the following form
"a/b/c) : (d /e/)"
where, a=Probability distribution of arrivals
b=Probability distribution according to which customers are
being served
c=Number of servers in the system
TEXTB0OK OF
604 OPERATIONS
e d F queuediscipline
e=Queuing capacity RESEARCH
ed f= Source capacity
restriction on the queue length, e =o, when
[When there is no the
population f= co].
come from an infinite [FCFS/oloo/]
Model 1: (MM/1) :
customers
Poisson
Mindicates that the arrival distribution is
service time distribution is exponential
Mindicates that the
that the service rate willfollow
Poisson distribution) (This mneans
indicates that there is only one server in the system
FCFS' indicates that the service discipline of First come-first served".
0 indicates that there is no restriction on the queue length
infinite.
o' indicates that the customer population is
Assumption: The mean service rate is higher than the mean arrival rate.
Important formulae of the Model

oueue or ot.
(a) Probability that there is no one in the system (i.e., either in the
the service counter)
P,=1-2
(b) Probability that the customer has to wait in the queue (i.e., probability
that the service facility in busy)
P,= 1-Podsss e
(c) Probabilitythat there are 'n' customers in the system
(i.e atleast
(d) Probability that there are n' or more customners in the system
'n' customers in the system)
P, or mnore =
inthe
customers
(e) Queue length of the system (or Average number of
system)
L,= n=0
n-P,
OUEUING THEORy
605
where P. =Probability that there are n customers in the system
n=0,1, 2, 3, .... o
When solved, the above will lead to
L,= (u-2)
(0Queue length (or Average number of customers in the queue), excluding
the customer at the service counter)
L,= XnP,-XP.
n=l
When solved, the above will lead to
H(4-2)
(e) Average waiting time in the system
(4-2)
(h) Average waiting time in the queue
2' 1
H(4-2) 2.
H(4-2)
Probability density function (p.d.f) of waiting line (i.e. probability that
) between time t, & t,)
acustomer shall have to wait
P= |['(u-1):e te dt
ILLUSTRATION 7.7
one booking clerk on duty. He attends to the calls from
Snipping agency has incoming calls
different destinations. The wants to book
sLomers on booking of cargo to
attended by a reception clerk. If a customer
booking clerk. If
k: agency are clerk transfers the cell to the to hold-on and
his/her
cargo, the reception
the booking clerk is busy, the receptionclerk asks to customer
becomes free. The reception
clerk as soon as he
transfers the call totthe booking

Queuing Model Opm

Uploaded by

Copyright:

Available Formats

Queuing Model Opm

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Queuing Model Opm

Uploaded by

Copyright:

Available Formats

system willbecome predictable, b03

of the has reached When this state is

P=Probability density function of waiting time [i.e., probability

Important formulae of the Model

(c) Probabilitythat there are 'n' customers in the system

When solved, the above will lead to

You might also like