Queuing Theory

Queuing System: GeneraI Structure

1. ArrivaI Process
According to source
According to numbers
According to time
2. Service System
SingIe server faciIity
MuItipIe, paraIIeI faciIities with singIe queue
MuItipIe, paraIIeI faciIities with muItipIe queues
Service faciIities in a Series
3. Queue Structure
First come first served
Last come first served
Service in random order
Priority service
perating Characteristics:
a) Queue Iength
average number of customers in queue waiting to get
service
b) System Iength
average number of customers in the system
c) Waiting time in queue
average waiting time of a customer to get
service
d) TotaI time in system
average time a customer spends in the system
e) Server idIe time
reIative frequency with which system is idIe
Queuing ModeIs
ModeI 1: Poisson-exponentiaI singIe
server modeI - infinite popuIation
Assumptions:
ArrivaIs are Poisson with a mean arrivaI rate of,
say
Service time is exponentiaI, rate being
Source popuIation is infinite
Customer service on first come first served basis
SingIe service station
For the system to be workabIe, ^
perating Characteristics of ModeI I:

K
1 p 1
0
P is
system the in customers no are there that Proportion or) (
time idIe s system' (or) time idIe s Server' 2.

K
p : busy is server the that time of Proportion (or)
intensity Traffic 1.
= =
=

2
q
L is
queue in the customers oI number average The . 5
s
L is
system in the customers oI number average The . 4
) 1 (
0
n
P is system in the
customers n exactly having oI y probabilit The . 3

=
= =

p p p
3
!
3

=
'

1
s
W
is system in the time waiting average The . 8
q
W
is queue in the time waiting average The . 7
q
L
is queues empty non oI length average The . 6
8
9
0 9
8
9
0 9

=
p ) (
q
W
is queue in the time oI units t' ' than more
spends customer a y that probabilit The . 10
) (
s
W
is system in the time oI units t' ' than more
spends customer a y that probabilit The . 9
1.The Taj service station has a central store
where service mechanics arrive to take
spare parts for the jobs they work upon.
The mechanics wait in queue if necessary
and are served on a FCFS basis. The
store is manned by one attendant who can
attend 8 mechanics in an hour on an
average. The arrival rate of the mechanics
averages 6 per hour. Assuming that the
pattern of mechanics' arrivals is Poisson
distributed and the service time is
exponentially distributed.
Find
1. Average time spent a mechanic in the
system.
2. Average time spent a mechanic in the
queue.
3. Average number of mechanics in the
queue.
4. Average number of mechanics in the
queue.
Suppose that the manager of the Taj service
station currently paying Rs.8 per hour to
each service mechanic and store room
attendant's wages are Rs.5 per hour.
Assuming 8-hour day, is it feasible to
engage one more attendant?
2. A repairman is to be hired by a company to
repair that breakdown following a Poisson
process, with an average rate of four per hour.
The cost of non productive machine time is
Rs.90 per hour. The company has the option of
choosing either a fast or slow repairman. The
fast repairman charges Rs70 per hour and will
repair machines at an average rate of 7 per
hour, while the slow repairman charges Rs50
per hour and will repair machines at an average
rate of 6 per hour. Which repairman should be
hired?
3. A warehouse has only one loading dock
manned by a three person crew. Trucks arrive at
the loading dock at an average rate of 4 trucks
per hour and the arrivals are Poisson distributed.
The loading of a truck takes 10 min on an
average and the loading time can be
exponentially distributed about this average. The
operating cost of a truck is Rs.100 per hour and
the members of the loading crew are paid at a
rate of Rs.25 per hour. Assuming that the
addition of new crew members would reduce the
loading time to 7.5 minutes, would you advise
the truck owner to add another crew of three
persons?
ModeI 2: Poisson-exponentiaI
singIe server modeI - finite
popuIation:
Assumptions:
ArrivaIs are Poisson with a mean arrivaI
rate of, say
Service time is exponentiaI, rate being
Source popuIation is finite
Customer service on first come first
served basis
SingIe service station
For the system to be workabIe, ^

,
|
>

n Ior , 0
n 0 ,
)! (
!
P
system, in the
customers n be shall re y that the probabilit The 2.

)! (
!
P
idle be shall system that the probabilty The 1.
: II - odel oI stics Characteri Operating
0
n
1
0
0
147
3

) 1 ( L
is, system in the customers oI number Average 4.
) 1 ( L
is, queue in the customers oI number Average . 3
0 s
0 q
!
!

=
1
0
1
1
q
W
is, system in the
customer a oI time waiting average The 6.
0
1
1
q
W
is, queue in the
customer a oI time waiting average The . 5

1. Past records indicate that of the five

machines that a factory owns, breakdowns
occur at random and the average time
between the breakdown is 2 days.
Assuming that the repairing capacity of the
workman is one machine a day and the
repairing time is distributed exponentially.
1. The probability that the service facility will be
idle.
2. The expected length of the queue.
3. The expected number of machines waiting to
be, and being repaired .
4. The expected time that a machine shall be wait
in the queue to be repaired
5. The expected time a machine shall be idle for
reason of waiting to be repaired and being
repaired.
6. Find the average cost per machine breakdown
if the machine idle time cost is Rs160 per
machine per day and the operator's cost is
Rs.40 per day and each workman charges
Rs.70 per day.
ModeI 3: Poisson-exponentiaI
muItipIe server modeI - infinite
popuIation
Assumptions
Arrival of customers follows Poisson law, mean
rate
Service time has exponential distribution, mean
service rate
There are K service stations
A single waiting line is formed
Source population is infinite
Service on a first-come-first-served basis
Arrival rate is smaller than combined service
rate of all service facilities




k n when ,
0
) ! (
n
P
k n when ,
0
!
n
P
is system in the customers n
be exactly be shall re y that the Probabilit 3.
1
) 1 ( !
1
0
!
0
P
is idle be shall system y that the Probabilit 2.
k

is Intensity TraIIic 1.
: III - odel oI stics Characteri Operating
>

=
=

=
=
=

!
3

3
!
3
3

p
p
1
s
W
system, in the time waiting Expected 7.
q
W
queue, in the time waiting Expected 6.
s
L
system, in the customers oI number Expected 5.
)
0
(
2
) 1 ( !
q
L
line, waiting in the customers oI number Expected . 4
=
=
=

=
6

1. A bank has two tellers working on savings

accounts. The first teller handles withdrawals
only while the second teller handles depositors
only. t has been found that the service time
distributions of both depositors and
withdrawals are exponential with a mean
service time of 3 minutes per customer.
Depositors and withdrawers and depositors
are found to arrive in a Poisson process
throughout the day with mean arrival rate of 8
and 16 per hour respectively. What would be
the affect on the average waiting time for
depositors and withdrawers if each teller could
handle both withdrawals and deposits?
p values for Model3
2. A company currently has two tool cribs, each having a
single clerk, in its manufacturing area. One tool crib
handles only the tools for the heavy machinery, while the
second one handles all other tools. t is observed that for
each tool crib the arrivals follow a Poisson distribution
with a mean of 20 per hour, and the service time is 2
minutes.
The tool manager feels that if the tool cribs are combined
in such a way that either clerk can handle any kind of
tools as demand arises, it would be more efficient and
the waiting problem could be reduced to some extent. t
is believed that the mean arrival rate at the two tool cribs
will be 40 per hour, while the service rate will remain
unchanged.
Compare in status of queue and the proposal with respect
to the total expected number of mechanics at the tool
cribs, the expected waiting including service time for
each mechanic and probability that he has to wait for
service.