Assignment No: 6

Queuing Models

Operation Research Technique (CVE 657)

By
AREMU, A.O. (04/30GB024)
Department of Civil Engineering
University of Ilorin, Nigeria.

CVE 657 Course Lecturer: Dr Salami

28th March, 2013

 Queuing Models by Aremu A.O. (04/30GB024) 2013

1i. Outline five operating characteristic s of a queuing system

Answer
 Queue length (Lq)
 System length (Ls)
 Waiting time in the queen (Wq)
 Total time in the system (Ws)
 Utilization factor ( ρ)

ii. What do you understand by queuing theory or waiting line? Illustrate with examples.
Answer
The queuing theory or waiting line theory owes it development to A.K Erlang. He, in 1903, took up the
problem on congestion of telephone traffic. The difficult was that during busy periods, telephone
operators were unable to handle the calls the moment they were made, resulting in delayed calls.
A.K. Erlang directed his first efforts at finding the delay for one operator and later on the results were
extended to find the delay for several operators.
Queuing problem is found in Businesses of all types, industries, schools, hospitals, cafeterias, book
stores, libraries, banks, post offices, petrol pumps, theatres.
Examples of queuing problem in industry are;
 in shops where machines wait to be repaired;
 in tool cribs where mechanics wait to receive tools and
 in telephone exchanges where incoming calls wait to be handled by the operators.
Further examples of queues, though less apparent are: waiting for a telephone operator to answer, a
traffic light to change, the morning mail to be delivered etc.
Waiting line problems arise either because
i. There is too much demand on the facilities so that we say that there is an excess of waiting
time or inadequate number of service facility.
ii. There is too less demand, in which case there is too much idle facility time or too many
facilities.
Understanding of queuing theory combined with imagination is required to apply the theory to
practical situations.

iii. Outline various ways in which queuing theory or waiting line can be applied.
Answer
Queuing theory or waiting line can be applied in
 Business situation
 Manufacturing units
 Determination of the proper number of docks to be constructed for trucks or ship
 Used for the problem of machine breakdowns and repair.
 Extended to decide wage incentive plans.
CVE 657. Course Lecturer- Dr A.W. Salami Page 2
 Queuing Models by Aremu A.O. (04/30GB024) 2013

 Scheduling of mechanical transport fleets.

 Scheduling distribution of scarce war material
 Scheduling of jobs in production control.
 Minimization of congestion due to traffic delay at tool booths.
 Solution of inventory control problems.

iv. Enumerate seven elements of a queuing system.

Answer
Elements of a queuing system are
a) Input or arrival (inter-arrival) distribution: it represents the pattern in which the number of
customers arrives at the service facility. Arrivals may also be represented by the inter-arrival
time, which is the period between two successive arrivals. The rate at which customers arrive
to be serviced, i.e., number of customers arriving per unit of time is called arrival rate.
b) Output or departure (service) distribution: it represents the pattern in which the number of
customers leave the service facility. Departures may also be represented by the service (inter-
departure) time, which is the time period between two successive services.
c) Service channels: The queuing system may have a single service channel. Arriving customers
may form one line and get serviced, as in a doctor’s clinic. The system may have a number of
service channels, which may be arranged in parallel or in series or a complex combination of
both.
d) Service discipline: Service discipline or order of service is the rule by which customers are
selected from the queue for service. The most common discipline is ‘first come, first served’,
according to which the customers are served in the order of their arrival.
e) Maximum number of customers allowed in the system: Maximum number of customers in
the system can be either finite or infinite. In some facilities, only a limited number of
customers are allowed in the system and new arriving customers are not allowed to join the
system unless the number becomes less than the limiting value.
f) Calling source or population: the arrival pattern of the customers depends upon the source
which generates them. If there are only a few potential customers, the calling source
(population) is called finite. If there are a large number of potential customers (say, over 40 or
50), it is usually said to be infinite.
g) Customer’s behavior: the customer’s behavior is also very important in the study of queues. If
a customer decided not to enter the queen since it is too long, he is said to have balked. If a
customer enters the queue, but after sometimes loses patience and leaves it, he is said to
have reneged. When there are two or more parallel queues and the customers move from
one queue to the other, they are said to be jockeying.

v. Distinguish between waiting time cost, idle time costs and total expected cost of operating
facility.
CVE 657. Course Lecturer- Dr A.W. Salami Page 3
 Queuing Models by Aremu A.O. (04/30GB024) 2013

Answer
Waiting time costs: the cost of waiting time generally includes either the indirect cost of lost
business (because people go somewhere else, buy less than they had intended to, or do not come
again in future) or direct cost of waiting equipment and persons; for example, cost of truck drivers
and equipment waiting to be unloaded or cost of operating an airplane or ship waiting to land or
dock.
Idle time costs: the cost of idle service facilities is the payment to be made to the servers (engaged at
the facilities) for the period for which they remain idle.
Total expected cost of operating facility: is when the waiting time cost is added to the cost of
providing service.
In order to solve a queuing problem, service facility must be manipulated so that an optimum balance
is obtained between the cost of waiting time and the cost of idle time.
By increasing the investment in labour and equipment (service facilities), waiting time and the losses
associated with it can be decreased. It is desirable, then, to obtain the minimum sum of these two
costs; costs of investment and operation, and costs due to waiting. This optimum balance of costs can
be obtained by scheduling the flow of units requiring service and/or providing proper number of
facilities. If the facilities are not under control, flow of units may be scheduled to minimize the sum of
waiting time and idle time costs. If the flow is not subject to control, that amount of equipment and
personnel be employed which minimizes the overall costs of operation. If both can be controlled,
one should schedule the input as well as provide facilities which minimize the overall cost.
Figure 1 illustrates the relationship between the level of service provided and the cost of waiting
time. It is observed that as the level of service is increased (as more servers are provided), the cost of
waiting time decreases.

Waiting
Time
Cost

Increased Service
Fig 1. Relationship between level of service and waiting time

Figure 2 illustrates the relationship between the level of service and the cost of providing that
service. It is observed that as the level of service is increases, so does the cost of providing that
increased service.
CVE 657. Course Lecturer- Dr A.W. Salami Page 4
 Queuing Models by Aremu A.O. (04/30GB024) 2013

Cost of providing service

Increased Service

Fig 2. Relationship between level of service and cost of providing service

In figure 3 the waiting time cost is added to the cost of providing service to establish a total expected
cost. We see that the total expected cost is minimum at a service level denoted by point S.

Total expected cost

Total expected cost of operating facility

S
Fig 3.Increased Service
Total cost of operating service facility

Thus the objective of the techniques explained is really to determine that particular level of service
which minimizes the total cost of providing service and waiting for that service.
Let C w = expected waiting cost/unit/unit time
Ls = expected (average) number of units in the system,
and C f = cost of servicing one unit.
λ
Then expected waiting cost per unit time (period) = C w . Ls =Cw . ,and expected service cost per
μ−λ
unit time (period) = C f . μ .
λ
Total cost, C=C w +µ Cf
μ− λ
CVE 657. Course Lecturer- Dr A.W. Salami Page 5
 Queuing Models by Aremu A.O. (04/30GB024) 2013

d
This will be minimum if (C )=0
dμ

Or if −C w .
λ
( μ−λ ) 2
Cf√
+C f =0 , which gives µ=λ ± C w . λ

Note that a plus and minus sign appear before the square root sign. A negative value of µ is not a
possible answer in real life problems. µ given by the above equation is called minimum cost service
rate.

2. Consider a situation in which the mean arrival rate is one customer every 6 minutes and the
mean service time is 3 ½ minutes. If the waiting cost is #15.00 per unit per minute and the minimum
cost of servicing one unit is #12.00, find the minimum cost service rate.
Solution

μ= λ ±

Where μ is minimum cost service rate

√ Cw
Cf
.λ

λ is expected unit per time

1
t ()
t is time(min)
C w = expected waiting cost/unit/unit time
C f = cost of servicing one unit.
C f =¿ 12.00 , C w =¿ 15.00, t=6 min
1
λ= =0.17
6

∴ μ=0.17 ±
μ=0.63units /minute
12 √
15 × 0.17
=0.17 ± 0.46

(∵ μ = -0.29 is not a feasible solution).

3a. What do you understand if a system is said to be in a transient or steady state of the system.
Answer
A system is said to be in transient state when the operating characteristics (behavior of the system)
vary with time. Usually a system is transient during the early stages of its operation, when its
behavior still depends upon the initial conditions (number of customers in the system) and the
elapsed time but it is the’ long-run’ behavior or the steady state condition of the system that is most
important.
A system is said to be in steady state condition if its behavior becomes independent of its initial
conditions and of the elapsed time. An essential condition for reaching a steady state is that the total
elapsed time since the start of the operation must be sufficiently large (theoretically, it should tend to
infinity). However, this is not the sufficient condition as the parameters of the system also affect its
state e.g., number of customers at the counter of a post office within 15 minutes of its opening.
CVE 657. Course Lecturer- Dr A.W. Salami Page 6
 Queuing Models by Aremu A.O. (04/30GB024) 2013

b. What is the limitation to the use of Poisson distribution?

Answer
The limitation to the use of Poisson distribution is discussed below.
 Poisson distribution cannot be applied to servicing because of the possibility of the service
facility remaining idle for some time.
 Poisson distribution assumes fixed time interval of continuous servicing, which can never be
assured in all services.
 Under the condition of continuous service, some characteristics of exponential distribution
are written without proof. For example the Probability of n complete services in time is
( λt )n . e−λt
po = is written without proof.
n!

3c. Solve exercise 10.1- Q1, Q2, Q3.

3ci. Discuss the costs associated with queuing system. Also explain the concepts of optimum
serving rate and optimum cost.
Answer
The cost associated with queuing system is waiting time costs, idle time costs and total expected cost
of operating facility.
Waiting time costs: the cost of waiting time generally includes either the indirect cost of lost
business (because people go somewhere else, buy less than they had intended to, or do not come
again in future) or direct cost of waiting equipment and persons; for example, cost of truck drivers
and equipment waiting to be unloaded or cost of operating an airplane or ship waiting to land or
dock.
Idle time costs: the cost of idle service facilities is the payment to be made to the servers (engaged at
the facilities) for the period for which they remain idle.
Total expected cost of operating facility: is when the waiting time cost is added to the cost of
providing service.

The concepts of optimum serving rate and optimum cost.

In order to solve a queuing problem, service facility must be manipulated so that an optimum serving
rate and optimum cost is balance. To determine how much business is lost, some type of
experimentation and data collection is required which led to the concepts of optimum serving rate
and optimum cost. Service rate is the number of customers served per unit of time (assuming the
service to be continuous throughout the entire time unit) and cost is the total expected cost of
operating facility.
The concept of optimum serving rate and optimum cost is by increasing the investment in labour and
equipment (service facilities), waiting time and the losses associated with it can be decreased. It is
desirable, then, to obtain the minimum sum of these two costs; costs of investment and operation,
CVE 657. Course Lecturer- Dr A.W. Salami Page 7
 Queuing Models by Aremu A.O. (04/30GB024) 2013

and costs due to waiting. This optimum balance of costs can be obtained by scheduling the flow of
units requiring service and/or providing proper number of facilities. If the facilities are not under
control, flow of units may be scheduled to minimize the sum of waiting time and idle time costs. If the
flow is not subject to control, that amount of equipment and personnel be employed which
minimizes the overall costs of operation. If both can be controlled, one should schedule the input as
well as provide facilities which minimize the overall cost.

3cii. In a bank operation, the arrival rate is 2 customers/minute. Determine the following:
a. the average number of arrivals during 5 minutes
b. the probability that no arrivals will occur during the next 30 seconds.
c. the probability that at least one arrivals will occur during the next 30 seconds.
d. the probability that the time between two successive arrivals is at least 3 minutes.
Answer
λ=2 customers/minute
a. the average number of arrival during 5 minutes (n )
n=λ ×t
Where λ=¿mean arrival rate
t=¿Arrival time
n = the average number of arrival
t=5 min (arrival time)
∴ n=2 ×5
¿ 10
the average number of arrival during 5 minutes is 10
b. the probability that no arrivals will occur during the next 30 seconds.
( λt )n . e−λt
po =
n!
p
Where o is probability of n arrivals in time t
1
t=¿ 30 seconds = minutes n=0
2

( )
1
1 o −2× 2
2× ×e
2
∴ p o=
0!
−1
1× e
¿
1
−1
=e
¿ 0.367
The probability that no arrivals will occur during the next 30 seconds is 0.367
c. The probability that at least one arrival will occur during the next 30 seconds.
p=1− po
CVE 657. Course Lecturer- Dr A.W. Salami Page 8
 Queuing Models by Aremu A.O. (04/30GB024) 2013

Where p is probability of an arrival in time t

¿ 1−0.367
¿ 0.633
The probability that at least one arrivals will occur during the next 30 seconds is 0.633
d. the probability that the time between two successive arrivals is at least 3 minutes.
−λt
p=e
t=¿ 3 minutes
−2 ×3
¿e
−6
¿e
¿ 0.00248
the probability that the time between two successive arrivals is at least 3 minutes is
0.00248

3ciii.Inventory is withdrawn from a stock of 80 items according to Poisson distribution at the rate
of 5 items per day. Determine the following:
a. The probability that 10 items are withdrawn during the first 2 days.
b. The probability that no items are left at the end of 4 days.
c. the average number of items withdrawn over a 4-day period.
Answer
n=80 items where n is number of items
μ=5 item/day μ is withdrawn rate
n
μ= t is number of days
t
The number of days it will take to withdrawn the whole stock of item is
n 80
t= = =16 days
μ 5

a. The probability that 10 items are withdrawn during the first 2 days.
The probability that 10 items are withdrawn during the first 2 days is =
−μt
p=1−e t=2 days
−5 × 2 −10 −5
¿ 1−e ¿ 1−e ¿ 1−4.54 ×10 =0.99995
≈1
b. The probability that no items are left at the end of 4 days.
( μt )n . e− μt
po =
n!
Where po is probability of n withdrawer in time t
t=¿ 4 days n=0
o − 4 ×5
( 4 × 5 ) ×e
∴ p o=
0!

CVE 657. Course Lecturer- Dr A.W. Salami Page 9

 Queuing Models by Aremu A.O. (04/30GB024) 2013

( 20 )o ×e−20
¿ =1× e−20
1
−20 −9
=e ¿ 2.06 ×10 ≈ 0

The probability that no items are left at the end of 4 days is 0

c. the average number of items withdrawn over a 4-day period.

n=μ× t
Where μ=¿mean withdrawer rate
t=¿Numbers of days
n = the average number of item withdrawn
t=4 days
∴ n=5 × 4
¿ 20
The average number of items withdrawn over a 4-day period is 20.

4.a Outline nine assumption of queuing model?

Answer
Assumptions of queuing model are;
 The customers arrive for service at a single service facility at random according to Poisson
distribution with mean arrival rate λ or equivalently, the inter-arrival times follow exponential
distribution.
 The service time has exponential distribution with mean service rate µ.
 The service discipline followed is first come, first served
 Customer behavior is normal i.e., customers desiring service join the queue, wait for their turn
and leave only after getting serviced; they do not resort to balking, reneging or jockeying.
 Service facility behavior is normal. It serves the customers continuously, without break, as
long as there is queue. Also if serves only one customer at a time.
 The waiting space available for customers in the queue is infinite.
 The calling source (population) has infinite size.
 The elapsed time since the start of the queue is sufficiently long so that the system has
attained a steady state or stable state.
 The mean arrival rate λ is less than the mean service rate µ.

4b. Outline six limitation of queuing model.

Answer
Limitation of queuing model
 The waiting space for the customers is usually limited.

CVE 657. Course Lecturer- Dr A.W. Salami Page 10

 Queuing Models by Aremu A.O. (04/30GB024) 2013

 The arrival rate may be state dependent. An arriving customer, on seeing a long queue, may
not join it and leave.
 The arrival process may not be stationary. There may be peak period and slack period during
which the arrival rate may be more or less than the average arrival rate.
 The population of customers may not be infinite and the queuing discipline may not be first
come, first served.
 Services may not be rendered continuously. The service facility may breakdown; also the
service may be provided in batches rather than individually.
 The queuing system may not have reached the steady state. It may be, instead, in transient
state. It is commonly so when the queue just starts and the elapsed time is not sufficient.

4c. Treat example 10.9-4.1 to 10.9 – 4.5 (page 927 – 929)

4ci. Example 10.9-4-1
A self-service store employs one cashier at its counter. Nine customers arrive on an average every 5
minutes while the cashier can serve 10 customers in 5 minutes. Assuming Poisson distribution for
arrival rate and exponential distribution for service time find
a. Average number of customers in the system
b. Average number of customers in the queue or average queue length.
c. Average time a customer spends in the system
d. Average time a customer waits before being served
Solution
number of customers arrival 9
Arrival rate λ= = =1.8 customers /minute
time 5
number of customers thecashier can serve 10
Service rate µ= = =2 customers/minu te
time 5
Average number of customers in the system ( Ls )
λ
Ls =
μ−λ
1.8
¿
2−1.8
¿9
Average number of customers in the queue ( Lq ¿.
2 2
λ 1.8
Lq = ¿
µ ( μ−λ ) 2 ( 2−1.8 )
¿ 8.1
Average time a customer spends in the system (W s)
1
W s=
μ−λ
1
¿
2−1.8
CVE 657. Course Lecturer- Dr A.W. Salami Page 11
 Queuing Models by Aremu A.O. (04/30GB024) 2013

¿ 5 minutes
Average time a customer waits in the queen (W q)

W q=
λ 1
µ μ−λ( )
2 2−1.8 )
(
1.8 1
¿

¿ 4.5 minutes

Example 10.9-4.2
A person repairing radios finds that the time spent on the radio sets has exponential distribution
with mean 20 minutes. If the radios are repaired in the order in which they come in and their arrival
is approximately Poisson with an average rate of 15 for 8-hour day, what is the repairman’s
expected idle time each day? How many jobs are ahead of the average set just brought in?
Solution
number of average radios that can repaired 15 1
Arrival rate λ= = = units/minute
time 8× 60 32
1
Service rate µ= units /minute
20
Number of jobs ahead of the set brought in = Average number of jobs in the system ( Ls )
λ
Ls =
μ−λ
1/32 5
¿ =
1/20−1/32 3
¿9
λ
Utilization factor ρ= (to determine the degree to which the capacity of a service is utilized)
µ
λ 1/32 20 5
ρ= = = =
µ 1/20 32 8
Number of hours for which the repairman remains busy in an 8-hour day = 8 ρ
5
8 ρ=8 × =5 hour s
8
∴ Time for which repairman remains idle in an 8-hour day
¿ 8−5=3 hours

Example 10.9-4.3
A branch of Punjab National Bank has only one typist. Since the typing work varies in length
(number of pages to be typed), the typing rate is randomly distributed approximating a Poisson
distribution with mean service rate of 8 letters per hour. The letters arrive at a rate of 5 per hour
during the entire 8-hour work day. If the typewriter is valued at Rs. 1.50 per hour, determine.
CVE 657. Course Lecturer- Dr A.W. Salami Page 12
 Queuing Models by Aremu A.O. (04/30GB024) 2013

1. Equipment utilization
2. The per cent time that an arriving letter has to wait.
3. Average system time
4. Average cost due to waiting on the part of typewriter i.e. it remaining idle.
Solution
Arrival rate λ=5 per hour ,
Service rate µ=8 per hour ,
1. Equipment utilization,
λ
ρ=
µ
5
¿ =0.625
8
2. The per cent time that an arriving letter has to wait.
Per cent time the typewriter remains busy
¿ 100 × ρ
¿ 100 ×0.625=65.5 %
3. Average system time
1
W s=
μ−λ
1
¿
8−5
1
¿ hr .=20 minute s
3
4. Average cost due to waiting on the part of typewriter i.e. it remaining idle.
¿ 8 × ( 1−5/8 ) × Rs . 4.50
¿ Rs . 4.50
Example 10.9-4.4
The milk plant at a city distributes its products by trucks, loaded at the loading dock. It has its own
fleet of trucks plus trucks of a private transport company. This transport company has complained
that sometime its truck have to wait in line and thus the company losses money paid for a truck and
driver that is only waiting. The company has asked the milk plant management either to go in for a
second loading dock or discount prices equivalent to the waiting time. The following data are
available;
Average arrival rate (all trucks) = 3 per hour,
Average service rate = 4 per hour
The transport company has provided 40% of the total number of trucks. Assuming that these rates
are random according to Poisson distribution, determine
1. The probability that a truck has to wait
2. The waiting time of a truck that waits
3. The expected waiting time of company trucks per day.
CVE 657. Course Lecturer- Dr A.W. Salami Page 13
 Queuing Models by Aremu A.O. (04/30GB024) 2013

Solution
Average arrival rate λ=3 per hour ,
Average service rate µ=4 per hour ,

λ
1. The probability that a truck has to wait for service =utilization factor = ρ=
µ
3
¿ =0.75
4
2. The waiting time of a truck that waits
1
W n=
μ−λ
1
¿
4−3
1
¿ =1 hour
1
3. Total expected waiting time of company trucks’ per day = Trucks/day x % of company trucks
x expected waiting time per truck.
Trucks per day (in 8-hour work day) = Arrival rate x 8= 3 ×8=24 trucks /day
40
% of company = 40 %= =0.40
100

Expected waiting time per truck = W q= ( ) ( )

λ 1
=
µ μ−λ 4 4−3
3 1
=0.75 hour

∴ Total expected waiting time of company trucks’ per day

= 24 × 0.40 ×0.75=7.2 hours /day

Example 10.9-4.5
Arrival rate of telephone calls at a telephone booth are according to Poisson distribution, with an
average time of 9 minutes between two consecutive arrivals. The length of telephone call is
assumed to be exponentially distributed, with mean 3 minutes.
a. Determine the probability that a person arriving at the booth will have to wait.
b. Find the average queue length that is formed from time to time.
c. The telephone company will install a second booth when convinced that an arrival would
expect to have to wait at least four minutes for the phone. Find the increase in flow rate of
arrivals which will justify a second booth.
d. What is the probability that an arrival will have to wait for more than 10 minutes before the
phone is free?
e. What is the probability that he will have to wait for more than 10 minutes before the phone
is available and the call is also complete?
f. Find the fraction of a day that the phone will be in use

CVE 657. Course Lecturer- Dr A.W. Salami Page 14

 Queuing Models by Aremu A.O. (04/30GB024) 2013

Solution
1
Arrival rate λ=
per minute
9
1
Service rate, μ= per minute
3
a. Probability that a person will have to wait
λ 1/9 1
¿ = = =0.33
µ 1/3 3

b. Average queue length that is formed from time to time

µ 1/3 1 /3 1 9
¿ = = = × =1.5persons
µ−λ 1/3−1 /9 2/9 3 2
c. Let λ 1 be the new (increased) arrival rate to justify the installation of the second telephone
booth.
λ1
Average waiting time in the queue =
µ ( μ−λ1 )

λ1
4=
1/3 . ( 1/3−λ 1 )

12 4
λ 1= = arrival s /minute .
7 × 9 21

4 1 5
∴ Increase in flow rate of arrivals − = per minute
21 9 63

∞
λ
probability (waiting time ≥ 10) ¿ ∫
− ( µ−λ ) t
d. . ( µ− λ ) . e . dt
10 µ
∞
λ
¿ ( µ−λ ) ∫ e−( µ− λ ) t
µ 10

[ ]
− ( µ− λ ) t ∞
λ e
Integrating ¿ . ( µ− λ ) .
µ −( µ− λ ) 10

( )
− ( µ−λ ) ∞ − ( µ−λ ) .10
λ e e
¿ . ( µ− λ ) . −
µ −( µ−λ ) −( µ−λ )

( )
− ( µ−λ ) .10
λ e
¿ . ( µ− λ ) . 0−
µ − ( µ−λ )

CVE 657. Course Lecturer- Dr A.W. Salami Page 15

 Queuing Models by Aremu A.O. (04/30GB024) 2013

λ e−(µ−λ ) .10
¿ . ( µ− λ ) ×−
µ − ( µ−λ )

λ −( µ−λ ) .10
¿ .e
µ

1
9 −( 3 −9 ) .10
1 1

¿ .e
1
3

−20
1 1
¿ .e 9
¿
3 30

= ∫ ( µ− λ ) . e
− ( µ−λ ) t
e. Probability (time in system ≥ 10) . dt
10

∞
¿ ( µ−λ )∫ e
−( µ−λ ) t

10

[ ]
−( µ−λ ) t ∞
e
Integrating ¿ ( µ−λ ) .
−( µ−λ ) 10

( )
− ( µ− λ ) ∞ − ( µ− λ ) .10
e e
¿ ( µ−λ ) . −
− ( µ− λ ) −( µ−λ )

( )
− ( µ−λ ) .10
e
¿ ( µ−λ ) . 0−
−( µ−λ )

e−( µ−λ ) .10

¿ ( µ−λ ) ×−
−( µ−λ )

− ( µ− λ ) .10
¿e

− (13 − 19 ).10
¿e
−20
9
¿e

¿ 0.1

e. The expected fraction of a day that the phone will be in use

CVE 657. Course Lecturer- Dr A.W. Salami Page 16
 Queuing Models by Aremu A.O. (04/30GB024) 2013

λ
¿
µ

1
9
¿
1
3

¿ 0.3 3

CVE 657. Course Lecturer- Dr A.W. Salami Page 17