Queueing Theory

Introduction, Case 1 and Case 2 (Single Server Models)

ENGR. YOSHIKI B. KURATA, CIE, AAE, MSc.IE

Course Instructor

Reference:

Introduction to Operations Research (7th Edition)

By F. Hillier & H. Lieberman
McGraw Hill Higher Education
Queueing System

 Body of knowledge about waiting lines

 Helps managers to better understand systems in manufacturing,
service, and maintenance.
 Provides competitive advantage and cost savings.

System Customers Servers

Grocery Store Shoppers Checkout Clerks
Phone System Phone Calls Switching Equipment
Toll Highway Vehicles Tollgate
Restaurant Parties of Diners Tables & Waitstaff
Factory Products Workers
Father of Queueing Theory

AGNER K. ERLANG
 Danish engineer, who, in 1909
experimented with fluctuating demand
in telephone traffic in Copenhagen.
 In 1917, he published a report
addressing the delays in automatic
telephone dialing equipment.
 At the end of World War II, his work
was extended to more general
problems, including waiting lines in
business.
 Queueing Theory
 It involves the mathematical study of waiting lines.

Service Served
Input Source Queue
Mechanism Customers

Queueing System

Balking – phenomenon when you see a long line and you don’t want to be there.
Renege – you are already in the line and you choose to leave.
Queueing Theory
 The Queueing Cost Trade-off

Cost

Total Cost
Minimum Cost of Providing
Service
Total ( salaries + benefits )
Cost

Cost of Waiting
Time
( time x value of time )

Low Level Optimal Service High Level

Of Service Level Of Service
Queueing Theory
Terminologies and Notations:

1. State of the System – number of customers in the queueing system.

2. Queue Length – number of customers waiting to be served; it is the
state of the system less the number of customers being served.
3. N(t) – number of customers in the queueing system at time, t, (t ≥ 0).
4. Pn(t) – probability that exactly n customers are in the system at time,
t, given the number at time 0.
5. s – number of parallel servers in the queueing system.
6. λn – expected number of arrivals per unit time when n customers are
in the system.
Queueing Theory
Terminologies and Notations:

7. µn – expected number of customers completing service per unit time

when n customers are in the system.
8. λ – expected number of arrivals per unit time when λn is constant for
all n.
9. µ – constant service rate (number of customers completing service
per unit time) based on one server.
10. µn = sµ , for n ≥ s
11. ρ – utilization factor
Note:
𝝀
𝝆=
𝒔𝝁
Queueing Theory
Terminologies and Notations (under steady-state conditions)

1. N – number of customers in the queueing system.

2. Pn – probability that exactly n customers are in the system.
3. W – expected waiting time in the system.
4. Wq– expected waiting time in the queue.
5. L – expected number of customers in the queueing system.
6. Lq – expected number of customers in the queue.

Note: Steady-state conditions mean what goes in, must go out.

Queueing Theory
Relationships among L, Lq, W and Wq:

𝑳= 𝝀𝑾
𝑳𝒒 = 𝝀 𝑾𝒒
𝟏
𝑾 = 𝑾𝒒 +
𝝁
Birth and Death Process
 Birth – arrival
 Death – completion of the system

Assumptions:

1. Given N(t) = n, the current probability distribution of the remaining

time until the next birth (arrival) is poisson with parameter λn (n =
0,1,2,…)

2. Given N(t) = n, the current probability distribution of the remaining

time until the next death (service completion) is exponential with
parameter µn (n = 0,1,2,…)

3. Only one birth or death can occur at a time.

Rate Diagram for the Birth & Death Process

l0 l1 lN-2 lN-1 lN

0 1 2 .... N-2 N-1 N N+1 ....

m1 m2 mN-1 mN mN+1

Rate IN = Rate Out Principle

Birth and Death Process
Let:
𝝀𝒏−𝟏 𝝀𝒏−𝟐 … 𝝀𝒏
𝑪𝒏 = , 𝒇𝒐𝒓 𝒏 = 𝟏, 𝟐, …
𝝁𝒏 𝝁𝒏−𝟏 … 𝝁𝟏
Then the steady state probabilities are:
𝝆𝒏 = 𝑪𝒏 𝑷𝟎 , 𝒇𝒐𝒓 𝒏 = 𝟏, 𝟐, …

The requirement then:

∞ ∞ ∞

෍ 𝑷𝒏 = 𝟏 𝑷𝟎 + ෍ 𝑷𝒏 = 𝟏 𝑷𝟎 + ෍ 𝑪𝒏 𝑷𝟎 = 𝟏
𝒏=𝟎 𝒏=𝟏 𝒏=𝟏

∞
𝟏
𝑷𝟎 𝟏 + ෍ 𝑪𝒏 = 𝟏 𝑷𝟎 =
𝟏 + σ∞
𝒏=𝟏 𝑪𝒏
𝒏=𝟏
 Birth and Death Process
Given are the following information:
∞

𝑳 = ෍ 𝒏𝑷𝒏
𝒏=𝟎
∞

𝑳𝒒 = ෍ 𝒏 − 𝒔 𝑷𝒏
𝒏=𝒔

𝑳 = 𝝀ത 𝐰
𝑳𝒒 = 𝝀ത 𝑾𝒒
𝑤ℎ𝑒𝑟𝑒:
λത = 𝑎𝑣𝑒𝑟𝑎𝑔𝑒 𝑎𝑟𝑟𝑖𝑣𝑎𝑙 𝑟𝑎𝑡𝑒 𝑜𝑣𝑒𝑟 𝑡ℎ𝑒 𝑙𝑜𝑛𝑔 𝑟𝑢𝑛
∞

λത = ෍ λ𝑛 𝑃𝑛
𝑛=0
Queueing Theory
Notation:

(a / b / c) : (d / e / f)
where:

a – arrival distribution
b – service distribution
c – number of parallel servers
d – service discipline
e – maximum number of customers allowed in the system
f – size of the input source
Case 1. (M / M / 1) : (GD / ∞ / ∞)
 Single Server, Multiple Customers

Notations:

P0 – probability that there is no customer on the queue (the server is idle)

𝝀 number of customers waiting to be served
𝝆=
𝝁 number of customers done

𝒏
𝝀 ∞
𝑷𝒏 = 𝑷𝟎 for n = 1,2,3,…
𝝁 ෍ 𝑷𝒏 = 𝟏
or 𝒏=𝟎
∞
𝑷𝒏 = 𝝆𝒏 𝑷𝟎 𝑷𝟎 + ෍ 𝝆𝒏 𝑷𝟎 = 𝟏
𝒏=𝟎
Case 1. (M / M / 1) : (GD / ∞ / ∞)
 Single Server, Multiple Customers

𝑷𝟎 + ෍ 𝝆𝒏 𝑷𝟎 = 𝟏
𝒏=𝟎
𝟏 𝟏
𝑷𝟎 = ∞ =
∞ σ𝒏=𝟎 𝝆𝒏 𝟏
𝟏 − 𝝆
𝑷𝟎 𝟏 + ෍ 𝝆𝒏 = 𝟏
𝒏=𝟎

𝑷𝟎 = 𝟏 − 𝝆
∞

𝑷𝟎 ෍ 𝝆𝒏 = 𝟏 provided ρ < 1
𝒏=𝟎
Case 1. (M / M / 1) : (GD / ∞ / ∞)
 Single Server, Multiple Customers

Formulas:

Pn – probability that exactly n customers are in the system

𝝀𝟐
𝑷𝒏 = 𝝆𝒏 𝑷𝟎 for n = 1,2,3,… 𝑳𝒒 =
𝝁 (𝝁 − 𝝀)
𝑷𝟎 = 𝟏 − 𝝆 provided ρ < 1
𝟏
𝑾=
𝝆 𝝀 𝝁 −𝝀
𝑳= =
𝟏 − 𝝆 𝝁 −𝝀 𝝀
𝑾𝒒 =
𝝁 (𝝁 − 𝝀)
Case 1. (M / M / 1) : (GD / ∞ / ∞)
Example 1:

A fast food restaurant has one drive-in window. Cars arrive according to a
Poisson distribution at a rate of 2 cars every 5 minutes. The space in front
of the window can accommodate at most 10 cars, including the one being
served. Other cars can wait outside this space, if necessary. The service
time per customer is exponential, with a mean of 1.5 minutes. Determine
the following:

(a) The probability that the facility is idle.

(b) The expected number of customers waiting to be served.
(c) The expected waiting time until a customer reaches the window to
place an order.
(d) The probability that the waiting line will exceed the 10-space
capacity.
Case 1. (M / M / 1) : (GD / ∞ / ∞)
S

a.) P idle = P0 b.) Lq

𝝀 𝝀𝟐
𝑷𝟎 = 𝟏 − 𝝆 = 𝟏 − 𝑳𝒒 =
𝝁 𝝁 (𝝁 − 𝝀)
𝟐ൗ 𝟐
𝟓 𝟐ൗ
𝑷𝒊𝒅𝒍𝒆 =𝟏 − 𝟓
𝟏ൗ 𝑳𝒒 =
𝟏. 𝟓 𝟏ൗ ( 𝟏ൗ − 𝟐ൗ )
𝟏. 𝟓 𝟏. 𝟓 𝟓

𝑷𝒊𝒅𝒍𝒆 = 𝟎. 𝟒𝟎 𝑳𝒒 = 𝟎. 𝟗 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓
Case 1. (M / M / 1) : (GD / ∞ / ∞)
S

c.) Wq
𝝀
𝑾𝒒 =
𝝁 (𝝁 − 𝝀)
𝟐ൗ
𝑾𝒒 = 𝟓
𝟏ൗ ( 𝟏ൗ − 𝟐ൗ )
𝟏. 𝟓 𝟏. 𝟓 𝟓

𝑾𝒒 = 𝟐. 𝟐𝟓 𝒎𝒊𝒏𝒖𝒕𝒆𝒔
Case 1. (M / M / 1) : (GD / ∞ / ∞)
S

d.) Let Pexceed = probability that the working line will exceed 10-space
capacity
∞ 𝟏𝟎 𝟏𝟎

𝑷𝒆𝒙𝒄𝒆𝒆𝒅 = ෍ 𝑷𝒏 = 𝟏 − ෍ 𝑷𝒏 = 𝟏 − 𝑷𝟎 ෍ 𝝆𝒏
𝒏=𝟏𝟏 𝒏=𝟎 𝒏=𝟎
𝟏𝟏
𝟐ൗ
𝟏 − 𝝆𝟏𝟏 𝟓
𝑷𝒆𝒙𝒄𝒆𝒆𝒅 = 𝟏 − 𝟏 − 𝝆 = 𝝆𝟏𝟏 = 𝟏𝟏
𝟏−𝝆 𝟏ൗ
𝟏. 𝟓
𝑷𝒆𝒙𝒄𝒆𝒆𝒅 = 𝟎. 𝟎𝟎𝟑𝟔
Case 1. (M / M / 1) : (GD / ∞ / ∞)
Example 2:

There is only one copying machine in the student lounge of a business

school. Students arrive according to a Poisson distribution at the rate of
40 students per hour. Copying takes an average time according to an
exponential distribution of 40 seconds, or 90 copies per hour. Compute
for the following:

(a) The percentage of time that the machine is used

(b) The average length of the queue
(c) The average number of the students in the system
(d) The average time spent waiting in the queue
(e) The average time in the system
Case 1. (M / M / 1) : (GD / ∞ / ∞)
Example 2: 𝜆 = 40 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝜇 = 90 𝑐𝑜𝑝𝑖𝑒𝑠

Answers:

(a) Utilization: (b) Average Length in the Queue (Lq):

𝝀 𝝀𝟐
𝝆= 𝑳𝒒 =
𝝁 𝝁 (𝝁 − 𝝀)

𝟒𝟎 𝒔𝒕𝒖𝒅𝒆𝒏𝒕𝒔 𝟒𝟎 𝟐
𝝆= 𝑳𝒒 =
𝟗𝟎 𝒄𝒐𝒑𝒊𝒆𝒔 𝟗𝟎 (𝟗𝟎 − 𝟒𝟎)

𝝆 = 𝟒𝟒% 𝑳𝒒 = 𝟎. 𝟑𝟓𝟔 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔

Case 1. (M / M / 1) : (GD / ∞ / ∞)
Example 2: 𝜆 = 40 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝜇 = 90 𝑐𝑜𝑝𝑖𝑒𝑠

Answers:

(c) Average # of students in: (d) Average Time spent waiting in the
system (L): Queue (Wq):

𝝆 𝝀 𝝀
𝑳= = 𝑾𝒒 =
𝟏 − 𝝆 𝝁 −𝝀 𝝁 (𝝁 − 𝝀)

𝟒𝟎 𝟒𝟎
𝑳= 𝑾𝒒 =
𝟗𝟎 − 𝟒𝟎 𝟗𝟎 (𝟗𝟎 − 𝟒𝟎)

𝑳 = 𝟎. 𝟖 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔 𝑾𝒒 = 𝟎. 𝟓𝟑 𝒎𝒊𝒏𝒖𝒕𝒆𝒔
Case 1. (M / M / 1) : (GD / ∞ / ∞)
Example 2: 𝜆 = 40 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠 𝜇 = 90 𝑐𝑜𝑝𝑖𝑒𝑠

Answers:

(e) Average Time in the System (W):

𝟏
𝑾=
𝝁 −𝝀

𝟏
𝑾=
𝟗𝟎 − 𝟒𝟎

𝑾 = 𝟏. 𝟐 𝒎𝒊𝒏𝒖𝒕𝒆𝒔
Case 2. (M / M / 1) : (GD / N / ∞)
 Single Server, Limited Number of Customers
𝑛𝜇, 𝑓𝑜𝑟 𝑛 = 1,2, … , 𝑠
Formulas: 𝜇𝑛 = ቊ
𝑠𝜇, 𝑓𝑜𝑟 𝑛 > 𝑠
𝑷𝒏 = 𝝆𝒏 𝑷𝟎 for n = 1,2,3,…

𝟏−𝝆
𝑷𝟎 = provided ρ ≠ 1
𝟏 − 𝝆𝑵+𝟏
𝟏
𝑷𝟎 = provided ρ = 1
𝑵+𝟏

𝝆 𝟏 − 𝑵 + 𝟏 𝝆𝑵 + 𝑵𝝆𝑵+𝟏
𝑳= provided ρ ≠ 1
(𝟏 − 𝝆)(𝟏 − 𝝆𝑵+𝟏 )
Case 2. (M / M / 1) : (GD / N / ∞)
 Single Server, Limited Number of Customers

Formulas:
𝑵 𝝀ത = 𝝀 (𝟏 − 𝑷𝑵 )
𝑳= provided ρ = 1
𝟐
𝝀ത
𝑳𝒒 = 𝑳 −
𝝁
𝑳
𝑾=
𝝀ത
𝑳𝒒 𝟏
𝑾𝒒 = or 𝑾𝒒 = 𝑾 −
𝝀ത 𝝁
Case 2. (M / M / 1) : (GD / N / ∞)
Example 1:

Patients arrive at a 1-doctor clinic according to a Poisson distribution at

the rate of 20 patients per hour. The waiting room does not accommodate
more than 14 patients. Examination time per patient is exponential, with a
mean of 8 minutes.

(a) What is the probability that an arriving patient will not wait?
(b) What is the probability that an arriving patient will find a seat in the
room?
(c) What is the expected total time a patient spends in the clinic?
Case 2. (M / M / 1) : (GD / N / ∞)
Example 1: (M / M / 1): (GD / 15 / ∞)
𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠 𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠
𝜆 = 20 𝜇 = 7.5
ℎ𝑜𝑢𝑟 ℎ𝑜𝑢𝑟

𝟏−𝝆 𝟏
(a) Pnot wait = P0 𝑷𝟎 = 𝑷𝟎 =
𝟏 − 𝝆𝑵+𝟏 𝑵+𝟏
provided ρ ≠ 1 provided ρ = 1
* Check for what formula:

𝜆 20 𝟏 − 𝟐𝟎ൗ𝟕. 𝟓
𝜌= = = 𝟐. 𝟔𝟕 ≠ 1 𝑷𝟎 = 𝟏𝟓+𝟏
𝜇 7.5 𝟐𝟎
𝟏 − ൗ𝟕. 𝟓

𝟏−𝝆
𝑷𝟎 =
𝟏 − 𝝆𝑵+𝟏 𝑷𝒏𝒐𝒕 𝒘𝒂𝒊𝒕 = 𝟐. 𝟓𝟓 𝒙 𝟏𝟎−𝟕
Case 2. (M / M / 1) : (GD / N / ∞)
Example 1: (M / M / 1): (GD / 15 / ∞)
𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠 𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠
𝜆 = 20 𝜇 = 7.5
ℎ𝑜𝑢𝑟 ℎ𝑜𝑢𝑟
𝟏𝟒

(b) Paccomodate = ෍ 𝑷𝒏
𝒏=𝟎

Paccomodate = 𝟏 − 𝝆𝑵 𝑷𝟎

𝟐𝟎 𝟏𝟓
Paccomodate = 𝟏 − (𝟐. 𝟓𝟓 𝒙 𝟏𝟎−𝟕 )
𝟕.𝟓

𝑷𝒂𝒄𝒄𝒐𝒎𝒐𝒅𝒂𝒕𝒆 = 𝟎. 𝟑𝟕𝟓
Case 2. (M / M / 1) : (GD / N / ∞)
Example 1: (M / M / 1): (GD / 15 / ∞)
𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠 𝑝𝑎𝑡𝑖𝑒𝑛𝑡𝑠
𝜆 = 20 𝜇 = 7.5
ℎ𝑜𝑢𝑟 ℎ𝑜𝑢𝑟
𝑳 𝝆 𝟏 − 𝑵 + 𝟏 𝝆𝑵 + 𝑵𝝆𝑵+𝟏
(c) W = ? 𝑾=
𝝀ത
𝑳=
(𝟏 − 𝝆)(𝟏 − 𝝆𝑵+𝟏 )

𝟏𝟓 𝟏𝟔
𝟐𝟎 𝟐𝟎 𝟐𝟎
𝟏 − 𝟏𝟓 + 𝟏 + 𝟏𝟓
𝟕. 𝟓 𝟕. 𝟓 𝟕. 𝟓
𝑳= 𝟏𝟔
𝟐𝟎 𝟐𝟎
(𝟏 − )(𝟏 − )
𝟕. 𝟓 𝟕. 𝟓
𝟏𝟒. 𝟒 𝒑𝒂𝒕𝒊𝒆𝒏𝒕𝒔
𝑳 = 𝟏𝟒. 𝟒 𝒑𝒂𝒕𝒊𝒆𝒏𝒕𝒔 𝑾= 𝑾 = 𝟎. 𝟕𝟐 𝒉𝒐𝒖𝒓𝒔
𝒑𝒂𝒕𝒊𝒆𝒏𝒕𝒔ൗ
𝟐𝟎 𝒉𝒓
Case 2. (M / M / 1) : (GD / N / ∞)
Example 2:

A barber shop has one barber and two chairs for waiting. The expected
time a barber to cut customer’s hair is assumed to be 15 minutes.
Customers arrive on a Poisson distribution at a rate of two per hour
provided the barber shop is not full. However, if the barber shop is full (at
least three customers), potential customers go elsewhere.
Determine the following:

(a) Probability that there is no customer in the system

(b) Probability that the system is full
(c) Expected number of customers in the queue
(d) Expected waiting time of the customers in the queue
Case 2. (M / M / 1) : (GD / N / ∞)
Example 2: (M / M / 1): (GD / 3 / ∞)
2 𝑐𝑢𝑠𝑡𝑜𝑚𝑒𝑟𝑠 1 𝑐𝑢𝑠𝑡𝑜𝑚𝑒𝑟
𝜆 = 𝜇 =
ℎ𝑜𝑢𝑟 15 𝑚𝑖𝑛𝑢𝑡𝑒𝑠

𝟏−𝝆 𝟏
𝑷𝟎 = 𝑷𝟎 =
𝟏 − 𝝆𝑵+𝟏 𝑵+𝟏
(a) Pno customer= P0
provided ρ ≠ 1 provided ρ = 1
* Check for what formula:
𝟏 − 𝟎. 𝟓𝟎
𝜆 1/30 𝑷𝟎 =
𝜌= = = 𝟎. 𝟓𝟎 ≠ 1 𝟏 − 𝟎. 𝟓𝟎𝟑+𝟏
𝜇 1/15

𝟏−𝝆
𝑷𝟎 =
𝟏 − 𝝆𝑵+𝟏 𝑷𝒏𝒐 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓 = 𝟎. 𝟓𝟑𝟑𝟑
Case 2. (M / M / 1) : (GD / N / ∞)
Example 2: (M / M / 1): (GD / 3 / ∞)
2 𝑐𝑢𝑠𝑡𝑜𝑚𝑒𝑟𝑠 1 𝑐𝑢𝑠𝑡𝑜𝑚𝑒𝑟
𝜆 = 𝜇 =
ℎ𝑜𝑢𝑟 15 𝑚𝑖𝑛𝑢𝑡𝑒𝑠
𝟐

(b) Pfull system = ෍ 𝑷𝑵

𝒏=𝟎

Pfull system = 𝟏 − 𝝆 𝑵 𝑷𝟎

𝟏/𝟑𝟎 𝟑
Pfull system = 𝟏− (𝟎. 𝟓𝟑𝟑𝟑)
𝟏/𝟏𝟓

𝑷𝒇𝒖𝒍𝒍 𝒔𝒚𝒔𝒕𝒆𝒎 = 𝟎. 𝟗𝟑𝟑𝟑

 Case 2. (M / M / 1) : (GD / N / ∞)
Example 2: (M / M / 1): (GD / 3 / ∞)
𝝀ത 𝝆 𝟏 − 𝑵 + 𝟏 𝝆𝑵 + 𝑵𝝆𝑵+𝟏
(c) Lq = ? 𝑳𝒒 = 𝑳 − 𝑳=
𝝁 (𝟏 − 𝝆)(𝟏 − 𝝆𝑵+𝟏 )

𝟎. 𝟓𝟎 𝟏 − 𝟑 + 𝟏 𝟎. 𝟓𝟎 𝟑 + (𝟑)(𝟎. 𝟓𝟎)𝟑+𝟏
𝑳=
(𝟏 − 𝟎. 𝟓𝟎)(𝟏 − (𝟎. 𝟓𝟎)𝟑+𝟏 )

𝝀ത = 𝟎. 𝟎𝟑𝟏𝟏
𝝀(bar) = 𝝀 1 − Pn
𝑳 = 𝟎. 𝟕𝟑𝟑𝟑 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔 𝝀(bar) = 1/30(1-P3)
𝝀(bar) = 1/30(1-((0.5)3(0.5333)
𝝀ത 𝝀(bar) = 1/30(1-0.0667)
𝝀(bar) = 0.0311
𝑳𝒒 = 𝑳 −
𝝁
𝟎. 𝟎𝟑𝟏𝟏
𝑳𝒒 = 𝟎. 𝟕𝟑𝟑𝟑 − 𝑳𝒒 = 𝟎. 𝟐𝟔𝟔𝟖 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔
𝟏/𝟏𝟓
Case 2. (M / M / 1) : (GD / N / ∞)
Example 2: (M / M / 1): (GD / 3 / ∞)

(c) Wq = ? 𝑳𝒒 𝟏 𝑳
𝑾𝒒 = or 𝑾𝒒 = 𝑾 − ; 𝑾=
𝝀ത 𝝁 𝝀ത
𝟎. 𝟕𝟑𝟑𝟑 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔
𝟎. 𝟐𝟔𝟔𝟖 𝒄𝒖𝒔𝒕𝒐𝒎𝒆𝒓𝒔 𝑾=
𝟎. 𝟎𝟑𝟏𝟏
𝑾𝒒 =
𝟎. 𝟎𝟑𝟏𝟏
𝑾 = 𝟐𝟑. 𝟓𝟕𝟖𝟖 𝒎𝒊𝒏𝒖𝒕𝒆𝒔

𝑾𝒒 = 𝟖. 𝟓𝟖 𝒎𝒊𝒏𝒖𝒕𝒆𝒔 𝟏
𝑾𝒒 = 𝟓. 𝟒𝟗𝟕𝟎 𝒎𝒊𝒏𝒔 −
𝟏/𝟏𝟓

𝑾𝒒 = 𝟖. 𝟓𝟖 𝒎𝒊𝒏𝒖𝒕𝒆𝒔