0% found this document useful (0 votes)
261 views23 pages

Probability and Queuing Theory (Ma 2262) Semester-Iv Question Bank-Iv Unit-Iv-Queueingtheory Part-A Problem 1 For Solution

This document contains 17 problems related to queueing theory. The problems cover concepts like: - Little's formula for M/M/1 queues - Formulas for average queue length and wait time in M/M/c queues - Calculating probabilities like probability of waiting time exceeding a threshold or probability of no customers in the system - Steady state equations for M/M/k queues - Effective arrival rates in queues - Determining the optimal repairman to hire based on service rates and costs in a queueing model - Deriving formulas for average queue length and wait time in M/M/1 queues

Uploaded by

Dharuman
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)
261 views23 pages

Probability and Queuing Theory (Ma 2262) Semester-Iv Question Bank-Iv Unit-Iv-Queueingtheory Part-A Problem 1 For Solution

This document contains 17 problems related to queueing theory. The problems cover concepts like: - Little's formula for M/M/1 queues - Formulas for average queue length and wait time in M/M/c queues - Calculating probabilities like probability of waiting time exceeding a threshold or probability of no customers in the system - Steady state equations for M/M/k queues - Effective arrival rates in queues - Determining the optimal repairman to hire based on service rates and costs in a queueing model - Deriving formulas for average queue length and wait time in M/M/1 queues

Uploaded by

Dharuman
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/ 23

PROBABILITY AND QUEUING THEORY (MA 2262)

SEMESTER-IV
QUESTION BANK–IV
UNIT–IV–QUEUEINGTHEORY

PART-A
Problem 1 For M MFIFO
//1 :/ model, write down the Little’s Formula.

Solution:
i) LW
SS

ii) LW
qq

1
iii) WW
Sq

iv) LL
Sq

Problem2 For M M
//:/CN FIFO model, write down the Formula for
a) Average number ofcustomersin the queue.
b) Average waiting time in the system.

Solution:
n cn c
a) Ln
q c 0 11 when
C! 1 c
1
b) WL
SS 1

i 1
1
Cc n n
n 0
1
LL
Sq

Problem3 What is the probabilitythat a customer has to wait more than 15 minutes to
get his service completed in aM M
//1 queuing system, if 6 per hour 10 per
hour?

Solution:
Probability that the waiting time in thesystem exceeds t is
Wt
edWe
t
Queuing Theory

1
15 10 6 .
4 1
P Wee
S 0.3679
60
Problem4 What is the probability that an arrival to an infinite capacity 3 server Poisson
1
queueing system with 2 and P0 entriesthe service without waiting.
9
Solution:
P[Without waiting] P NPPP 3 012
n
1
PP
n 0 when nc 3.
n!
12115 2
PN 32 .
99299
Problem5 Inagiven M MFCFS
//1 :/ queue, 0.6 , What is the probability
that the queue contain 5 or more students?

Solution:
5 5
PX 50, 60.0467
Problem6 What is the effective arrival rate forM MFCFS
//1 : 4 / queuing model
when 2 and 5

Solution:
1
1
1/12 / 5
51 0 K 15
1/12 / 5
3 / 50.6
5 15 1 5
12 / 5 1 0.01024
0.6
5 15 1 0.607
0.989
5 0.393 1.9652
Problem7 a)In M MK //1 :/FIFOwrite down the expression forP 0.

b) In M //1
MK:/,3/,4
FIFOhrhr
/,7 K Calculate P0
Solution:
1
a) Pof
0 K 1

1
of
K 1

2
Queuing Theory

b) Pof
0 1 K 1

3
4
10.2778 8
3
1
4
Problem8 In M //:/,10
M SFIFOhrhr
/,15 /,2 S Calculate P0

Solution:
ns 1
S 1
11 s
P0
n 0 nSs
!!
2 1
1 101 1030
1
1! 152! 1530 10
1
2
Problem9 In a two server system withinfinitecapacity and 20 /hr and 11/hr ,
find P0.

Solution:
ns 1
S 1
11 s
P0
n 0 nSs
!!
2 1
201 2011 2
1
112 1122 20
1
21
Problem10 Write the steadystates equations inM //1
MK:/FIFO where
n for nK 0,1, 2...1
0 for nk
andn n 1, 2,3

Solution:
PPPnK
nnn
11 11
PPn
10 0

3
Queuing Theory

Problem11 In M //1
MK:/,3/,5
FIFOhrhr
/,7 K , what is the
probability that the server will be idle.

Solution:
The probabilities that the server will be idle
1 32
1
55 0.4
P0 K 18
0.407
3 1 0.01680.983
1 1
5

Problem12 In M //:/,
M SK FIFO write the expression for 0P
.

Solution:
ns 1
sk1
11 ns
P0 //
nn0s nss
!!
Problem13 What iseffective arrival rate in M M
//:/SK FIFO

Solution:
Effectivearrival rate
s 1
1
ssn n
n 0

Problem14 In M M
//:/SK FIFO with
3.76 /4,2,7,
hr andsk compute P5 where P0 0.3617.

Solution:
1 n
PP
50 /
s! sn s
5
13.76
52
0.3617
2!24
0.0166

PART-B

Problem15A repairman is to be hired to repair machines which break down at an


average rate of 3 per hour. Thebreakdown followsPoissondistribution. Non-productive
time of machine is considered to cost Rs.16/hr.Two repairmen havebeen invited. One is
slow but cheap while the other is fast and expensive. The slow repairman charges Rs.8
per hour and he services machines at rate of 4 per hour. The fast repairman demands
Rs.10perhour and service at the average rate of 6 per hour. Which repair man should be
hired?

4
Queuing Theory

Solution:
For the slow man: Model M MFIFOHrhr
//1 :/3 /,4 /
11
Expected waiting time of a machine 1hr
43
Non productive cost =16 / hr
Non productive cost =3 16=Rs.48.
Charges paid to the repairman8 324
Total cost =48+24=72
For fast man:M
3 /,6
hrhr
/.
11
Expected waiting time hour
3
1
Non productive cost316 16
3
Charge paid torepairman 10 1 10
Total cost =16+10=26
Fast repairman can be hired.

Problem16A two person barber shop has 5 chairs to accommodate waiting customers.
Customers who arrive when all5 chairs are full leave without entering barber shop.
Customers arrive at the average rate of 4 per hour and spend an average of 12 minutes in
thebarber’schair. ComputeP01,Pand average number of customers in the queue

Solution:This is model M M
//:/04
CK /,5
FIFhrhr
/,2,2 57
CN
17 i
111 nn
P0 // n 2
nn02 nC
!!2
1
25
48222
11...
525555
0.4287
1
PP
n n nc /,0 0
CC !
1 7
P7 72
4 / 50.4287
22!
0.0014.
C
PC N CN C
LPNC
q 0 2
11
C! 1
Where / C

255 0.4
0.4287. 0.810.45 0.60.4
2
0.15Customers
2! 1 0.4

5
Queuing Theory

Problem17Derive the formula for


i) Average numberLq of customers in the queue.
ii) Average waiting time of a customer in the queue for
M MFIFO
//1 :/ MODEL.

Solution:
LnPnPP
qnnn 1
nnn
111

nPPPnPP
nnn 00 1
nnn
100

LP
s 1 0
2
11

ii) Average waiting time of a customer is the queue


Wq
w
WWedw
q where / ew is the probability density
0
function of the waiting time distribution of the queue.
w
w. edw
0

ww
eedw
W
0 0

Problem18 On average 96 patients over 24 hour day require the service of an


emergencyclassic. Also on averagea patient requires 10 minutesof active attention.
Assumethatthe facility can handle any oneemergency at a time. Suppose that it costs the
clinic Rs.100 per patient treated to obtain an average servicing time of 10 minutes and
that each minute of decrease in this average time would cost Rs.10 per patient treated.
How much would have to be budgeted by the clinic to decrease the average size of the
1 1
queuefrom 1 patient to patient?
3 2
96
Solution:This is M MFIFO
//1 :/ model 4 /hr .
24
6 /hr
41
Lq .1
33
1 1
Now 1 customers to be reduced to , then we have to find 1 suchthat
3 2

6
Queuing Theory

1 21
ie 4320
2
111
8408 Patient/hr
'
115
Average time required to each patient hr
82
155
Decrease in the time required to attend a patient
10 min.
22
Decrease in each minute cost Rs.10 per patient.
5
Cost 1025 .
2
Budget required for each patient=100+25=125 todecreasethe size of the queue.

Problem19Obtain the expressions for steady state probability of a M/M/C queuing


system

Solution:
n nnC1
Cnc
It can be treated as a birth death process with
n for all n and n
isgiven by (1)

In a birth death process


1
n a
n
i 1 i 1
PP
n 0 and P0 1 for M/M/C.
i 1 i n 1 i
i 1
01 1 n
PP
n .... 0
121 n
n
P0
...1nifnC
12
n
ofnc
1
niP n 0
n
cc 1 ......
Pcif
n nc ....1
121 nc
n
nc 1
....11
cc
12
n
n 1
Cof nc
C! n

7
Queuing Theory

C 1 nn
P0 n cn
nn0c ncc
!! n

Problem20Arrivals at a telephone booth are considered to be Poisson with an average


time of 12 mins. The length of a phone call is assumed to be distributed exponentially
with mean 4 min. Find the average number of persons waiting in the system. What is the
probability that a person arriving at the booth will have to wait in thequeue?Also
estimate the traction of theday. Where phone will be in use

Solution:This is model M MFIFO


//1 :/
1
12,12 per min

11
4, per min
4
1
LS 12 0.5.
11
412

P LP
Ss tP0101 [No customer in the system]
1
111//.
P0
3
2
P Phone will be idle = P0 1
3
1
P Phone will be in use =
3
Problem21 There are three typists in an office. Each typist can type an average of 6
letters per hour. If letters arrive for being typed at the rate of 15 letters per hour, what
fraction of time all the typists per hour will bebusy? Whatis the average number of
letters waiting to betypes?

Solution:This is M M
//:/CFIFO
Chrhr
3,15 /,6 /
P[allthe three typistsbuy] PN 3
3

P0

3! 1
3

8
Queuing Theory

1
P0 r 1
11
n 3
n 0 n!

c! 1
c
1

2 3
2.5
2.5 1
1 2.5
2! 15
3! 1
63
0.0449.
P N 30.7016
c 1

LP
q 2 0

c. c! 1
4
2.5
0.04493.5078
25
3 6 12
3

Problem22A bankhas two tellers working are savings account. The first teller handles
with drawals only the second teller handles deposits only. It has been found that the
service time distributions for both depositsand withdrawals are exponential with mean
service timeof 3 minutes per customer. Depositors are found to arrive in a poisson
fashion through out the day with mean arrival rate of 16 per hour withdrawalsalso arrive
in a poisson fashion with mean arrival rate of 14per hour. What would be the effect on
the average waiting time for the customers if each teller could handle both withdrawals
anddeposits?

Solution:
1.When the tellers handleseparately withdrawals and deposits. This is Model
M MFIFO
//1 :/ .
For depositors 16 /,20
hrhr/
1
Whr
q 12 min
5
For withdrawals 14 /,20
hrhr/

Wq 7 min

ii) If both tellers do both service, one it will be aM MFIFO


//1 :/ model.
Chrhr
220 /16 1430 /

9
Queuing Theory

nc 1
i 1
11 c
P0
n 0 ncc
!!
2 1
30130401
1
2022040
i 307
c 2
30
11111 20
WP
q 0
c. c!20 2.21722 30
1 1
c 40
0.06423.857
hr or

Problem23In a heavy machine shop, the overhead crane is 75% utilized. Time study
observations gave the averageslinging timeas 10.5 minuteswith a SD of 8.8 minutes.
What is the average calling rate for the service of thecrane and what is the average delay
in getting service?If the average servicetime is cut to 8.0minutes, with a standard
deviation of 6.0 minutes,how muchreduction will occur on average in thedelay of
getting service?

Solution:This is model M GFIFO


//1 :/
Average delay is getting service
1 22
p /
21
0.75,5.71/,8.8.hr
2
0.758.860 2
15.71
2 1 0.75605.71
Average calling rate 0.75 5.714.28 per hr. If the servicetime is cut to
604.29
8 minutes, then 7.5 /,0.571
hr
87.5
utilization of the crane reduced to 57.1 percent and average delay in getting service

2
0.57160060 2
Wq 17.5
2 1 0571607.5
8.3 minutes.
a reductionof 18.5 minutes approximately 70%

Problem24A Super market has two girls ringing up sales at thecustomers. If the service
time for each customer is exponential with mean 4 minutesand if the people arrive in a
Poisson fashion at the rate of 10 per hour
a) What is theprobability of having to wait for service?
b) What is the expected percentage if idle time for each girl?

10
Queuing Theory

Solution:
This is model M M
//:/CFIFO
111
,;2. C
643 C
n 2 1
c 1
14142.1/ 41
P0
n 0 n! 62! 62.1/ 4 1/ 62

2 11
PP
10 .
3 23
111
a) P CPc21
c 2 236
Expected number of idle girls
b) Probability of any girl being idle .
Total number of girls
11
21
21 PP
01 23 4
0.67
C 26
Hence expected percentage of idle time each girl is 67%.

Problem25At a one man barber shop, the customers arrive following poisson process at
an average rate of5 per hour and they are servicedaccording to exponential distribution
with an average service. Rate of 10 minutes assuming that only 5 seats areavailable for
waiting customers find the average time a customer spends in the system.

Solution:
This is model M MN
//1 :/FIFO
5 /.hr
1
6065 per hour N
10
5
P
6
5
1
10.1666 6
P0 N 1 6
0.2505.
10.6651 5
1
6
LS
Wwhere
S

n 1 6
5
n 1 6
5 6
LS 6
65 5
11 n 1
6

11
Queuing Theory

6.03352.01
55198
1 0.3350.665
'
1 P0
6 1 0.25054.497
11.98
WLhrs
sS '
0.441
4.497
Problem26 At a railway station, only one train is handled at a time. The railway yard is
sufficient onlyfor two trains to wait while theother is given signal to leave the station.
Trains arrive at the station at an average of 12 per hour. Assuming poisson arrivals and
exponential service distribution, find the steady state probabilities forthenumber of
trains in the system also find the average waiting time of a new train coming into the
yard. If the handling rate is reduced to half, what is the effect of the above results?

Solution:
This is Model M MK
//1 :/FIFO
Hence 6 /,12
hrhrk
/,3
Steady state probability for the number of trains in the system
P123
,P and P .

n 1
PPwhen
n P 00 K 1

6
1
12 0.50.5
44
0.5333
6 10.5 0.9375
1
12
1

PP
10 0.2667
2

PP
20 = 0.1334
3

PP
30 0.0667

1
Average waiting time of a new train coming in the yardWL
issS where
K 1

K 1
Ls K 1

12
Queuing Theory

4
6 4 0.5
4
0.7333.
12 6 10.5
1
112 1.053335.6004
c
0.7333
Whrs
s 0.1309
5.6004
Case II

If the handling rate is reduced to half, then 6 /,6


hrhr
/3 and k
11
Hence Pn
k 14
1
PPP
123
4
Average waiting time of a new train coring into the yard in
Ls
Ws 1

K 3
LSincetrain
s 1.5
22
1 1
16 P
14.5
0
4
Ls 1.5 1
Whrs
s or
1
0.333(20 )
4.5

Problem27At a port there are 6 unloadingberths and 4 unloading crews. When all the
berths are full, arriving ships are diverted to an overflow facility 20 kms down the river.
Tankers arrive according to a poisson process with a mean of 1 for every 2 hrs. Ifittakes
for an unloading crew on the average, 10 hrs to unload atanker, the unloading time
follows an exponential distribution Determine.
a)How many tankers one of theport on the average?
b) How long does a tanker spend at the port as the average?

Solution:
1

PP
10 0.0361
2
1
PP
20 0.0901
2!
3
1
PP
30 0.1502
3!
Ls 4.82144 0.007213 0.03612 0.09010.15024.3539 tankers.
b) Time spend by a tanker at the port

13
Queuing Theory

c 1
1 1
WL
SSnWhereCcn
1
n 0

10123 SPPPP
432
1
4 4 0.007213 0.03612 0.09010.1502
10
0.3532
4.3539
WS 12.3250
0.3532
Problem28A petrol pump has 2 pumps. The service time follows the exponential
distribution with a mean of 4 minutes and ears arrive for service in apoissonprocess at
the rate of 10 cars per hour. Findthe probability that a customer has to want for service.
What proportion of time the pumps remain idle?

Solution:
This is model M M
//:/CFIFO
14
10 /15
hrishrC
/2
60
P[ a customer has to wait ] P nc
c

P0

C! 1
c
2
10
15
P nP where
2 0
10
2! 1
30
nc 1
c 1
11 c
P0
n 0 nccp
!!
2 1
1 101 1030
1
1! 152! 1530 10
1
211
1
332
2
2
3 11
Probability that a customer has to want P
inn 2.0.1667
2 26
2.
3

14
Queuing Theory

101
The traction of time when the pumps are busy =traffic intensity
c 303
Hencethe pumps remain idle1
12
167%
33
Problem29A supermarket has two girls serving at the customers. The customersarrive
inaPoisson fashion at the rate of 12 per hour. The service time for each customer is
exponential with mean 6 minutes. Find
i) The probability that an arriving customer has to want for service.
ii) The average number of customers in the system,and
iii)The average time spent by a customer in the supermarket.

Solution:This is M M
//:/CFIFO .Here
16
Xhrhr
12c/,10 /,2
60
i)Probability that an arrival customer has to wait is
C

P0
P nc
Ci 1
c
21
121 12201
P0
102! 1020 124

2
121
104
Pn 20.45
12
2! 1
20
The probability that an arrival customer has to want=0.45

c 1

1
ii) Average number of customer is the system
LP
s 2 0
c. c!
1
c
3
12
1112 10
1.8752 customer
2.2!410 12 2
1
20
iii) Average time spent by a customer in the supermarket =Average waiting time
of a customer in the system

15
Queuing Theory

11.875
WLhours
ss 0.15639.375 minutes.
12

Problem30Four counters are being run on the frontier of a country to checkthe


passports of the tourists. The tourists choose a counter at random. If the arrival at the
frontier is poisson at the rate
and the service time is exponential with parameter ,
2
find the steadyaverage queue at each counter.

Solution:
This is M M
//:/CFIFO
Average queue length

1
LP
q 2 0
c. c!
1
c
nc 1
3
11 c
P0
n 0 nCic
!
23 1
2212 4
1 22
264!2
3
23
12534
Lq 2
0.1739
4.4!2323
1
2

Problem31 In a given M/M/1 queuing system the average arrivals is 4 customers per
minutes 0.7 what are
1) Mean number of customers
Ls in the system
2) Mean number of customers Lq in the queue.
3) Probability that the service is idle.
4) Mean waiting timeWs in the system.

Solution:
0.70.7
Ls 2.33.
11 0.70.3
LL
qs 2.333 0.71.633.
P0 11.070.3

16
Queuing Theory

Ls 2.333
Ws 0.583
4

Problem32 A TV repairman finds the time spend on his job has an exponential
distribution with mean 30’.If he repairs setsin the model in which they come in and of
the arrival of sets is approximately poisson with an average rate of 10 sets per 8 hours
day, what is the repairman’s expected idle timeeach day ?Howmany jobs ahead of the
average set just brought in?

Solution:
105 1
We are given sets per hour 602 sets per hour
84 30
5
Then
8
53
The probability of no unit in the queue is
P0 11
88
3
Hencethe idle timefor repair man in an 8-hours day 8 3 hrs
8
5
4 2
Ls 1 jobs = 2 TV Sets (approx)
5 3
2
4

Problem33 If for a period of 2 hours in the day trains arrive at the yard every 20
minutes buttheservice time continuous to remain36 minutes. Calculate the following for
theabove period.
i) The Probability that the yard is empty
ii) The average number of trains on the assumption that the line capacity of the yard
is limited to4 trainsonly.

Solution:
1 1
This model is M MK
//1 :/FIFO Hence per min; per min ,
20 36
K 4.
i) Probability that the yard is empty
1
P0 K 1
,
1

36
1
20 0.0447
5
36
1
20

17
Queuing Theory

ii) Average numberof trains


K 1

K 1
Lof
S K 1

1
5
136
5
2020
5
30 27
11 36
1
3620 20
=3 trains.

Problem34 Suppose there are 3 typists is a typing pool. Each typist can type anaverage
of 6 letters / hr. Ifletters arrive to be typed at the rate of 15 letters/hr
a) What isthe probabilities that there is only one letter in the system
b) What is the average number of letters waiting to be typed?
c) What is the average timea letter spends in the system?

Solution:
This is M M
//:/SFIFO
ns 1
s 1
11 s
P0
n 0 nss
!!
n 3 1
2
1 151 1518
n 0 n! 63! 618 5
1
118
1 2.5 3.12515.625
63
0.04494.

n
1
a) PPSince
10 ns
n!
1
1 15
0.044940.11235
1! 6
b) Average numbers of letters waiting to be typed
S 1

1
LP
q 2 0
ss!
1
s

18
Queuing Theory

4
15
1 6
2
0.04494
3.3! 15
1
18
3.51094.Letters
1
C) WLss

1
Lq

115
3.510940.40073 hr
156
24.0438.

Problem35 An automobile inspection station has 3 inspection stalls. Assume that cans
wait in such a way that when a stall becomes vacancy the car at the head of the time pulls
up to it. The Station can accommodate at most 4 cars waiting at one time. The arrival
pattern is poisson with a mean of I car every minute during the peak hours. The service
time is exponential with mean6 min. Find the average number of customers is the queue
during peak hours and the average waiting time in the queue.

Solution:
This is M M
//:/CK FIFOModel.
ck 3,7.
60 /10
hrhr/.
mCm c 1
ik 1
11
P0
mm0 vmCc
!!
m 3 1
27
116 m 3
66
mm03m!3!3

1
11
1 666 1 2 23234
222
2!3!
7 1
7 18 36 3111410.000.8764

i) Average no of customer is the queue.


c
1 K CK C
LPKC
q 0 2
11
c! 1
6
Where 2
c 3

19
Queuing Theory

21
6344
.0.00087641 24 1 2 22
3! 1 2
3.09
ii)Average waiting time in the queue.

c 1
1 '
WL
qqmwhereccm
'
P
m 0
2
1
10 33 m Pm
m 0

10 3 32PPP
012

10 3 3 0.00087 2 0.005256 0.015768


29.7630
3.09
Lhrs
q 0.103.
30
n
1
Hence PP n nc 0 ;3
n!
1 1
P1 60.0008764 0.005256
1!
1 2
P2 60.00087 0.015768
2!
Problem36 Patientsarrive at a clinic according to Poisson distribution at a rate of 60
patients per hour. The waiting room does not accommodate more than 14 patients
Investigation time per patient in exponential with mean rate of 40 per hour.
a) Determine the effective arrival rate at the clinic.
b) What is the probability that an arriving patient will not wait?
c) What is the expected time (waiting) until thepatient isdischargedfrom the
clinic?
Solution:This is M M //:/IK FIFOmodel hence 60 patients / hr,
40 /.14
hr K1 15
a) Effectivearrival rate
1
1 P0

1
Where Pof
0 K 1

60
1
40 0.0007624
6
60
1
40

20
Queuing Theory

1
40 1 0.000762439.9695
hr/
b) An arrived will rut want =there is no patient is the clinic.
P[ a patient will not wait ] P0 0.0007624
c) Effective waitingtime
LS
WS 1

K 1

K 1
When LS K 1

1
16
60
16
60 40
16
40 60 60
1
40
2 16.00 14Patient
14
Whr
s or 0.350321.018
39.9695

Problem37 A group of users in a computer browsing centre has 2 terminals. The


average computing jobrequires 20 min of terminal time and each user requires some
computation about once every half an hour .Assume that the arrival rate is poisson and
service rate is exponential and the group contains 6 users. Calculate
a) The average number of users waiting to use one of the terminals and in the
computing job.
b) The total time lost by all users per day when the centre is opened 12 hrs/day.

Solution:
13011201
This is M M
//:/SK FIFOHence ;
602603
2 /,3
hrhr
/2,6
sk
a) The average number of users waiting to use terminals and in the
Computing job is nothing but me average number of uses in the system.

S 1
LLSSn
Sqn P
n 0

nsn s 1
Sk1
11
P0
nn0s nSs
!!
1
2234
2121111
11 0.5004
32! 33333

21
Queuing Theory

s
K Sk s
LPyKSWhere
q 0 y 2
11
S! 1 s
1
244
2121 3
0.5004. 14 2
3333 2
2!
3
0.0796
s 1
LLSSn
Sqn P becomes
n 0

LSPP
q 2 01

LSPP
q 2 00

2
0.0796 2 2 0.50040.5004
3
0.7452.
b) Average waiting time of a user in the queue
Wq
1
WL
qq where
1

S 1
1
SSn P n
n 0

2
SPP
23012 2 0.50040.5004
3
1.9968
10.0796
WLhr
qq 1
0.0399
1.9968

Problem38 The railway marshalling yard is sufficient only for trains (there are 11
lines one of which is earmarked for the shutting engine to reverse itself from the crest of
the hump to the rate of thetrain). Train arrive at the rate of 25 trains per day, inter-arrival
time and service time follow exponential distribution with an average of 30 minutes
Determine.
a) The probability that the yard is empty.
b) The average queue length.

Solution:
This is model M MK
// :/ FIFO
1
Hence 25 trains /day, 300.0333 train /min

0.0174

22
Queuing Theory

K 10 11 1
a)Probability that the yard is empty.
1
Pif
0 K 1

0.0174
1
0.0333 1 0.5225
1111
0.4779
0.0174 10.5225
1
0.0333
c) Average queue length.
K 1

K 1
Lof
S K 1

1
11
0.0174
11
0.0174 0.0333
11
0.0333 0.0174 0.0174
1
0.0333
0.008721
1.09434.
0.9992
1.0856

23

You might also like