QUEUEING THEORY

Queueing Theory Problems

PROBLEM 1
The counter of a bank branch performs the transactions with a mean time of 2
minutes. The customers arrive at a mean rate of 20 customers/hour. If we assume that
arrivals follow a Poisson process and that the service time is exponential, determine:

a) Percentage of the time the bank teller is idle

b) Mean waiting time of the customers
c) Percentage of customers that wait in a queue

PROBLEM 2
A grocery shop is attended by one person. Apparently, the arrival pattern of
customers during Saturdays follows a Poisson process with an arrival rate of 10
persons/hour. Customers are attended following a FIFO order and, due to the prestige
of the shop, once they arrive, they are willing to wait for the service. The service time is
distributed exponentially, with a mean time of 4 minutes. Determine

a) Probability of waiting in line

b) Average length of the waiting line
c) Average waiting time

PROBLEM 3
Customers arrive at a hair salon with a mean rate of 5 customers/hour and inter-
arrival times distributed exponentially. There is always one hairstylist present in the
salon at any moment and there are 4 chairs for the customers that arrive when the
hairstylist is busy. The law regarding fire prevention limits the total number of customers
in the salon, at any moment, to a maximum of 5. Customers that arrive when the salon
is full can’t enter in it. Service time is distributed exponentially with a mean that depends
on the number of customers. Determine:

a) Average number of waiting customers

b) Average waiting time
c) Percentage of time that the hairstylist is idle

Number of customers in the salon 1 2 3 4 5

Mean service time per customer (min.) 9 10 10 13 20

PROBLEM 4
In a factory, there is a Social Security office where the workers can go during working
hours. The Chief of Staff, who has observed the inflow of workers to the office, has asked
to perform a study of this service. A specialist has been appointed to determine the
average waiting time of the workers and the average duration of the conversation with

November 2019 1
QUEUEING THEORY

the office employee. This analyst reaches the conclusion that in the first and last half
hours of the shift the inflow is very reduced and fluctuating, but during the remaining
seven hours of the shift the phenomenon can be considered in steady state. From the
analysis of 100 periods of 5 minutes, consecutive or not, but in the steady state phase, it
can be deduced that the mean number of workers going to the office was 1.25 per period
and the inter-arrival time followed an exponential distribution. A similar study about
the duration of the conversations concluded that its distribution was exponential with a
mean duration of 3.33 minutes. Determine:

a) Average number of workers waiting

b) Average waiting time
c) Compare the time spent by the workers and the time spent by the office employee.
Determine the cost for the company if an hour of the office employee is 250 € and
one hour of the worker 400 €. Would it be profitable to open another office?

PROBLEM 5
Let us assume that the fleet of Iberia has four planes of type Airbus A350. Since 2015
the turbine failures of these planes have been observed. Data indicate that the failure for
any turbine in any plane is a random variable with exponential distribution and the mean
time to failure for any turbine is one year. The mean time to repair the turbine failure is
only 45 days (one eighth of a year) and follows an exponential distribution. Only a single
expert team can repair them, and they provide the service under the policy “first in the
workshop, first to be repaired”. In the repair period, the plane doesn’t fly. Describe
quantitatively the queueing system.

PROBLEM 6
A bank considers the possibility of installing a teller network in one of its branches.
Given that they don’t know the people inflow demanding the service, they only put a
single teller for a month. The collect data daily about the arrival time of the customers,
as well as the service time. If the branch is in a district where there is no such service,
the customer that arrives waits until he/she can use the teller when it is busy. After the
corresponding data analysis, it is estimated that:

1. The arrivals follow a Poisson process

2. The distribution of the service time is exponential
3. The mean time between consecutive arrivals is 7.5 minutes
4. The mean service time is 5 minutes/customer

Determine:

a) Mean waiting time that each customer must spend in the queue
b) Average number of waiting customers

November 2019
 QUEUEING THEORY

c) Average queue length when it is not empty and probability that when going to the
teller there will be somebody in the queue

PROBLEM 7
In a workshop, up to four machines can be repaired by two technicians. Machines
arrive at the workshop for being repaired once every three hours on average and the
mean repairing time is 45 minutes. If both times follow an exponential distribution, which
is the average number of machines broken and waiting for being repaired in steady state?

PROBLEM 8
A bank branch has two office employees equally efficient and capable of attending 60
operations/hour on average, with the true time distributed exponentially. Customers
arrive at the bank branch following a Poisson process with a mean rate of 100
customers/hour. Determine:

a) Probability of strictly more than 3 customers simultaneously in the bank branch

b) Probability that at least one of the employees will be idle

PROBLEM 9
A self-service car wash has four sections. In each one, the customers can wash and
wax their cars. There is only space for a maximum of three additional cars when the
washing sections are full. Customers arrive at the service following a Poisson process with
a mean rate of 15 cars/hour. If there is no room for waiting, cars must leave the service.
Apparently, the time required to service a car is distributed exponentially with a mean
of 12 minutes. Determine:

a) Average number of cars in the service at any moment

b) Average number of cars per hour that are rejected because the service is full

PROBLEM 10
In the border between countries A and B, the road from B to A is split into five
migration and customs inspection booths. Let’s assume that car arrivals have a Poisson
distribution with 15 arrivals/hour, while the number of services follows an exponential
distribution of 8 services/hour.
By Government decree, there is no treatment priority (is that credible?), so the
inspection booths provide the service as soon as they are free, attending the cars by order
of arrival to the queue.
Check if l < m , and in positive case, interpret this inequality. Moreover, determine:

a) Compute p0 , L , Lq , Wq , W , defining its meaning

b) Study if it would be reasonable to suppress three booths

November 2019 3
QUEUEING THEORY

PROBLEM 11
The workers of a factory must carry their work to the quality control department
before the product goes to the final production process. There are many employees and
the arrivals are approximately 20 workers/hour, following a Poisson process. The time
to inspect a part follows an exponential distribution with a mean of 4 minutes. Determine
the average number of workers in the quality control department if there are: a) 2
inspectors, b) 3 inspectors.

PROBLEM 12
Consider a queue with a single server and Poisson arrivals with 10 arrivals/hour on
average. Usually, the server works with an exponential distribution with a mean service
time of 5 minutes. The management has a training course that achieves an improvement
(decrease) in the service time variance at the expense of a small increase in the mean.
After finalizing the study, it is estimated that the mean service time will increase in 0.5
minutes and the standard deviation will decrease from 5 to 4 minutes.

a) The management would like to know if they should continue with the employee as is
or if they should continue with the new training course. Discuss the results
b) Compute the variance reduction needed to counteract an increase of 0.5 minutes of
the mean

PROBLEM 13
The manufacturer of a specialized electric conductor has a large manufacturing
volume. The conductor is subject to a single mechanical manipulation by a specialized
machine. Given the sale volume, the company has a lot of equal machines working all
the time (let’s assume that the number of machines is infinite). Machines break following
a Poisson process with a mean 5 machines/hour. The company has a single repair
technician and the failures are of two possible types due to the characteristics of the
machines. Depending on the failure type, it can be repaired in 9 or 12 minutes.
As the technician is an expert and the machines are identical, the possible variation
in repair times are negligible and can be ignored. The type of cause that produces the
failure is distributed randomly, but one third of the failures need 12 minutes for being
repaired. Determine the average number of failed machines.

PROBLEM 14
An airplane takes, almost exactly, 4 minutes to land from the time where the control
tower gives it the landing signal. If the airplane arrivals are 8/hour on average and follow
a Poisson process, how much time can the pilot expect to fly around the airport until
receiving the landing signal?

PROBLEM 15
In the emergency unit of a hospital, emergency cases arrive with a Poisson
distribution of once every 5 hours on average. Before any surgical operation or any other

November 2019
 QUEUEING THEORY

intervention, each patient must follow a medical exam and a diagnosis of his/her disease.
This process takes 15 minutes (almost exactly). Compute (assuming the system in steady
state):

a) Average number of patients that have not been operated yet

b) Average time a patient waits until entering the operating room
c) Average time a patient waits until being examined
d) Average number of patients waiting to be examined

November 2019 5
QUEUEING THEORY

Additional Queueing Theory Problems

PROBLEM 16
A computer company has a server and customers can access this server from terminals
(of different times) that they rent. A customer needs to determine the terminal optimal
speed that should rent. Customer works are generated as a Poisson process with a rate
of 50 works per day of 8 hours. The average size of the work is 1000 instructions. It is
known that the processing time of the instructions is exponential. The customer estimates
in 10 € the cost of delaying a work one day.
The company estimates that a speed of 100 instructions/minute and any similar
increase, increases the monthly rent price of the terminal by 100 €. Assume that a month
has 22 working days. Determine the optimal terminal speed.

PROBLEM 17
Consider that a workshop can hire one out of two possible technicians. The first
technician earns 3 € an hour and can repair 5 machines/hour. The second one earns 5 €
an hour but can repair 8 machines/hour. Both salaries are paid no matter if they are
busy or idle. Customers estimate that a broken machine represents a cost of 8 €/hour
and the workshop assumes it as a cost per unit of waiting time per customer. Assume
that machines arrive at the workshop following a Poisson process of 4 machines/hour
and the repair time follows an exponential distribution. Which technician would be more
economical for the company?

PROBLEM 18
A company, which has four machines that are frequently broken, hires a person
devoted exclusively to repairing them. The repair time follows an exponential distribution
of 2 hours on average. Once the machine has been repaired, the time to failure again
follows an exponential distribution of mean 10 hours. When the machine is under repair,
the wasted time has a value of 20 €/hour and the repair service costs 45 euro a day.
Assume a working day of 8 hours.

a) Compute the steady-state distribution

b) Compute the average number of operating machines in a steady state
c) Which is the average cost per day of the wasted time?
d) Would it be profitable to have two technicians, each one attending two machines?
e) Would it be profitable to have two technicians, each one attending the four machines?

PROBLEM 19
A small company, which manufactures devices for computers, has 10 machines for
this task. Machines are frequently broken, but there are 8 persons in charge of operating
them. So, two of them are in reserve to be used when some of the active ones fail.
Therefore, as soon as there are no more than two broken machines eight will be used.

November 2019
 QUEUEING THEORY

The time to failure has an exponential distribution with a mean of 20 days. The
repair time dis distributed with an exponential with a mean of 2 days.
Up to now, the factory has had only a technician that repaired the broken machines
with the corresponding effect on the production when there were less than 8 available
machines. Therefore, they are thinking about hiring another technician to be able to
repair two machines at the same time.
Each technician costs 70 €/day, but the profit loss estimated for productivity
reduction per each one of the 8 machines not working is 100 €/day.

PROBLEM 20
A railway company paints its own wagons, as they need, in its own workshops where
each wagon is manually and individually painted with a speed that is exponentially
distributed with a mean of one every 4 hours and an annual cost of 4 million €. Wagons
arrive with a Poisson process of mean one every 5 hours. Besides, the wagon cost when
it is not active is 500 euro an hour.
They are thinking about two possibilities. One is to subcontract the process to a
painting company that would use aerosol spray with the consequent saving in time.
However, the budget for this alternative is 10 million € per year. In this case the process
can be approximated by a Poisson process with a rate of one every 3 hours.
The other option is to install a new workshop exactly like the existing one, with equal
service rate and annual cost that allows painting simultaneously two wagons.
In all the cases work is considered uninterrupted, i.e., they work 8760 hours a year.
Which of the three procedures is preferable?

PROBLEM 21
A radio repair company receives an average of 10 repair demands per day, which are
distributed according to a Poisson process. Assume that µ is the repair rate of the
repairing machine in radios/day and the repair time is exponential. Each unit of repair
rate has a cost of 100 €/week.
Moreover, it has been estimated that the cost of having unrepaired radios is 200 €
per radio and week, being this cost proportional to time. Assuming a week has 5 working
days, determine:

a) Optimal repair rate

b) If it would be more economical to have two machines, each one with half the rate
determined in the previous question

PROBLEM 22
A dentist has a consultation room where patients arrive according to a Poisson
process with a rate of 5 patents/hour. The waiting room has three chairs and no patients
are allowed if there are no seats available. The mean time the dentist pay attention to
each patient is exponentially distributed, but its value depends on the number of patients
in the consultation room:

November 2019 7
QUEUEING THEORY

Number of patients 1 2 3 4
Mean service time (minutes) 9 10 12 15

Give the steady-state probabilities of the number of patients in the consultation room.

PROBLEM 23
The accounting department of a company has a computer system with several PCs
in the same domain, a PC acts as a printing server (which processes the works by first
in-first out criterion without any priority) and two equal printers (with an unlimited
buffer). Members of the department have raised an application (complaint) to the
Management to improve the printing service, claiming that the printers are saturated at
the end of the month (when they close the balance sheet).
After making the corresponding observations at the end of the month and analyzing
the data obtained, they have extracted the following conclusions:

 Time between printing orders from the server follows an exponential distribution of
mean 5 minutes
 Processing time of the server follows an exponential distribution of mean 1 minute
 Printing time follows an exponential distribution of mean 7.5 minutes

Answer the following questions:

1. If a steady state is reached, which would be the arrival rate of the printing works?
2. Let’s get rid of the printing server, has the system a steady state distribution? Why?
3. Continue without the server, which is the average number of works pending at the
end of the day?
4. In the same conditions that the previous question, if they remain at work doing extra
hours until the printers end (without sending additional works), how many hours will
need to be paid on average?
5. In the same conditions that the previous question, if we consider that while work is
being printed the employee is idle and, therefore, it is wasted time and the employee
hour costs 20 €, which cost per hour has this system?
6. In the same conditions that the previous question, if the employee wasted time while
waiting for the work to be printed is considered an added cost, which cost will be
added to each work if the printed work is invoiced to a customer, if on average each
work requires to be printed 10 times before being ready?

PROBLEM 24
Consider a repairing workshop with a robot. Consider the possibility of changing it
by another one. Both robots are different, with different costs. The following table shows
the data of each robot, understanding that the operation costs correspond to the costs

November 2019
 QUEUEING THEORY

per unit of time when the robot is doing some repair and amortization costs are costs per
unit of time, no matter the robot is repairing or not.

Amortization costs (€/h) Operation costs (€/h)

Robot 1 100 200
Robot 2 150 400

The first robot can repair 6 machines/hour and the second one 7 machines/hour.
When a machine is in the repair workshop consider a cost per unit of time due to
productivity loss estimated in 80 €/h and the workshop assumes it as cost per unit or
time and customer. Assume that the machines arrive at the workshop with a Poisson
process with a rate of 5 machines/h and the repair time required by the robots follows
an exponential distribution.
Decide analytically which of the two robots is preferable comparing the cost per hour
with both robots and give that cost.

PROBLEM 25
Juan Pérez is studying the possibility of opening a car wash workshop. With that
purpose, he has received an offer to buy a site priced at 750 €/m2. With his experience
in this type of business he knows he will need a plot of 30 m2 to install the washing
machine and, besides, 12 m2 for each vehicle to be admitted in the workshop and waiting
the queue to be washed. Cars that don’t enter inside the workshop will be forced to go
to another service center.
Moreover, and given the knowledge about another workshop of the same type he had
in the same area as well as a small statistical study, he has obtained that interarrival
times are distributed with an exponential distribution of mean 10 minutes.
Determine:

1. If the time to wash a car is distributed with an exponential of mean 6 minutes and
the price is 4 €, determine the additional site is needed to optimize the design of the
workshop for an operation period of a year (365x12x60=262800 min), assuming a
steady state.
2. Assume there is no site limit, so there is no reserved site required because the cars
can wait in front of the workshop door as many as they want, but it is estimated 0.5
€/minute of time the car is in the car workshop of waiting for the access. Juan Pérez
wants to buy a slow machine that lasts exactly 6 minutes to wash a car and costs
36000 € and a quick machine costs 60000 € that only requires 4 minutes to wash a
car. Moreover, vehicles to be washed can be cars or trucks. The washing time for a
truck is double than the one for a car and the percentage of cars is 65 %. Which is
the average queue length for each machine? Which machine will be bought thinking
on a month of operation (262800 minutes)?

PROBLEM 26

November 2019 9
QUEUEING THEORY

There is a manufacturing plant with two spots, A and B. Products must go through
both spots, being processed first in A and then in B. The process in spot A takes 3
minutes on average and in spot B 4 minutes.
Determine:

1. Which is the maximum production that can be achieved per hour in the plant? If the
products arrive with an interarrival time distributed exponentially with mean 5
minutes, which is the hourly production assuming a steady state?
2. If besides being exponential the interarrival times are also the service times, which
will be the estimated time from the arrival of the product to the plant until it reaches
the queue of spot B? And if the service times were deterministic and no exponential?
3. Assuming that the interarrival time is exponential but the products are of two types
so in spot A 20% takes 3 minutes to be processed and the remaining ones 4 minutes
and the cost of the time a product spends in the system is 0.2 €, which cost of the
total hourly cost for the company corresponds to spot A? Which cost attributable to
spot A should be assigned to each product?

PROBLEM 27
At the beginning of the year, a toy manufacturer faces the production planning for
the third trimester. From the business point of view, the third trimester has been good
75% of the years, understanding as good the one when the average daily demand is 12
units, and as bad when this demand is only 8 units. In both cases daily demands are
random, independent and distributed according to Poisson laws.
Historically, it is known that when the second trimester is good the third one is also
good in 80 % of the cases, while if the second one is bad the third one is good in 30% of
the cases.
Building a toy requires the use of two machines A and B, and the manufacturer has
only one machine of each type. Process in machine A consists of assembling 6 identical
components and the machine takes a random time to do it following an exponential
distribution of mean 30 minutes. Process in machine B, done after machine A, consists
of assembling 9 identical components (although of another type than those assembled in
A) and the processing time follows an exponential distribution of mean 48 minutes.
The manufacturer wants to attend all the orders, for this and if needed rents
additional machines of any type. Observe that if the third trimester is good, he/she must
rent an additional machine of type B to satisfy the demand, given that works 8 hours a
day. The rent cost for the third trimester for machine B is the following:

 If the machine is rented at the beginning of the year the cost is 1200 €
 If the machine is rented before the end of June (when it is known if the second
trimester has been good or bad) 1500 €
 If the machine is rented at the beginning of the third one and it is known if the third
trimester is good or bad, 2000 €

November 2019
 QUEUEING THEORY

1. Which is the optimal policy for the toy manufacturer regarding the possible renting
of the machines?
2. Which is the average time it takes to be sent to his/her requestor since his/her request
until the toy is processed by both machines if the trimester is bad and there is only
one machine? What if the trimester is good?

Note: if arrivals and services are Poisson-type, departs follow also a Poisson process.

PROBLEM 28
Some parts arrive at a workshop to be processed following a Poisson law with a mean
of 15 parts an hour. Parts can go through two different processes, A and B, being 2/3 of
the processes of type A. The process sequence is shown in the figure, where in spot C2
there are 2 machines for parts type A.

Artículos
C2 Proceso A
2/3
2 máquinas
15art/h
C1

1/3
Artículos
C3 Proceso B

The process in spot C1 is the same for both parts and follows an exponential law of
mean 3 minutes. In spot C2, process time follows an exponential distribution of mean 10
minutes and in C3 the processing time follows a normal distribution of mean 7.5 minutes
and standard deviation 2 minutes.

a) Estimate the time required by a part type A and a part type B, since its arrival until
its departure1.
b) It is estimated as 0.1 € each minute the time spent by any part in the system, which
hourly cost will have the system? Which cost must be assigned to each part by the
process?

PROBLEM 29
An entrepreneur wants to install a motorbike repair workshop in a summer zone from
June 15 until September 15. The premises that rents have a capacity of 4 motorbikes,
either being repaired or waiting to be repaired, so any biker who arrives at the workshop
and finds it full must go to another workshop.

1
Consider that if the arrivals follow a Poisson process and service times are exponential, then
departures also follow a Poisson process.

November 2019 11
QUEUEING THEORY

From June 15 until July 15 the arrivals of failed motorbikes follow a Poisson law
with a mean of 12 motorbikes a day. Since July 16, this mean can increase to 24
motorbikes with a 0.75 probability or reduce to 6 with 0.25 probability.
Repairing a motorbike takes a random time governed by an exponential law of mean
2 hours. The workshop Works 24 hours a day in three shifts of 8 hours each.
Regarding the number of technicians to hire for repairing, the entrepreneurship has
the following options:

1. Hire on June 15 for all the season a set of three technicians (one for each shift) with
a monthly cost of 15000 € or to two sets of three technicians (two for each shift) with
a monthly cost of 30000 €.
2. Hire on June 15 for all the season a set of three technicians (one for each shift) with
a monthly cost of 15000 €. For the last two months of the season but signing the
contract on July 16, before knowing the evolution of the arrival of failed motorbikes,
we can hire a second set of three technicians that will cost 25000 € a month.

If the mean profit for each motorbike is 65 € and using the expected value criterion,
which hiring policy must be recommended to the entrepreneur? Assume months of 30
days.
How much the entrepreneur would be willing to pay to know before July 15 the
average failed motorbikes until the end of the season?

PROBLEM 31
A section of the local Administration has two offices A and B. Users go to office A,
where there is one clerk, following an arrival pattern governed by a Poisson law of 12
people/hour and the attention time follows an exponential law of mean 4 minutes.
Users then go to office B, where the attention time also follows an exponential of
mean 7.5 minutes for each clerk.
How many clerks will be needed in office B if you want the probability of waiting
more than 10 minutes to be lower than 0.05?
Being 𝑆 the number of servers in an M/M/S system, the probability of not having
people in the system is:
l 1
F= , p0 = S n
Sm (S F) S -1
(S F)
+å
S ! (1 - F) n =0 n !
Probability of waiting for tc time units greater to 𝑥 is given by:
S
(S F)
P (tc > 0) = p0
S ! (1 - F)

P (tc > x ) = e -S mx (1-F)P (tc > 0)

November 2019
 QUEUEING THEORY

Solutions of Queueing Problems

SOLUTION OF PROBLEM 1
This is a M/M/1 system with infinite population, with 𝜆 = 20 customers per hour, and
𝜇 = 30 customers per hour.
a) P (idle bank teller) = p0 = 1 - r = 1 / 3. 33.33 % of the time is idle.
b) Wq = 1/15 = 4 minutes
c) L = 2, Lq = 4 / 3 . Fraction in queue = 2/3. 66.67 % of the system customers are
waiting in the queue.

SOLUTION OF PROBLEM 2
This is a M/M/1 system with infinite population, with 𝜆 = 10 people per hour, and 𝜇 =
15 people per hour.
a) P (waiting line) = 1 - p0 - p1 = 4 / 9
b) Lq = 4 / 3 people in the queue.
c) Wq = 2 /15 hours = 8 minutes on average in the queue.

SOLUTION OF PROBLEM 3
It is an M/M/1/5 system where the arrival rate is constant l = 5 customers/hour
and the service rate depends on the number of customers in the hairdresser, where

m1 = 6.6 customers/hour or m5 = 3 customers/hour.
5 52 53 25
C1 =  = 0.75 , C2 =  = 0.625 , C3 =  = ,
6.6 4 6.6 ⋅ 6 5 6.6 ⋅ 6 ⋅ 6 48
5 325 5 1625
C4 =  = , C5 =  =
6.6 ⋅ 6 ⋅ 6 ⋅ 4.62 576 6.6 ⋅ 6 ⋅ 6 ⋅ 4.62 ⋅ 3 1728
𝑝 𝑝 𝑝 𝑝 𝑝 𝑝 1

𝑝 𝐶𝑝 𝐶 𝑝 𝐶 𝑝 𝐶 𝑝 𝐶 𝑝 1

𝑝 1 𝐶 𝐶 𝐶 𝐶 𝐶 1
1 1
p0 = ¥ = = 0.2272
1 + 0.75 + 0.625 + 25 / 48 + 325 / 576 + 1625 /1728
åC n
n =0

p1 = C 1p0 = 0.1704 , p2 = C 2 p0 = 0.1420 , p3 = C 3 p0 = 0.1184 ,

p4 = C 4 p0 = 0.1282 p5 = C 5 p0 = 0.2137
,
¥
a) Average number of people in the system L = å np
n =0
n = 2.3909 customers. (In this
case here: L=0*p0+1*p1+2*p2+3*p3+4*p4+5*p5).
Lq 1.6182
b) Average waiting time Wq = = = 0.4116 hours being
lEF 3.9315
lEF = l(1 - p5 ) = 5(1 - 0.2137) = 3.9315 customers/hour and

November 2019 13
QUEUEING THEORY

5
Lq = å (n - 1)pn = 1 ⋅ 0.1420 + 2 ⋅ 0.1184 + 3 ⋅ 0.1282 + 4 ⋅ 0.2137 = 1.6182
n =2
customers.
c) Hairstylist is idle with a probability P0 = 0.2272 .

SOLUTION OF PROBLEM 4
This is a M/M/1 system with infinite population, with 𝜆 = 0.25 workers per minute
(1.25/5), and 𝜇 = 0.3 workers per minute.

a) Lq = 4.16 workers.

b) Wq = 16.6 minutes.
c) The worker attention cost is approximately 14000 €/day (7 hours/day*5 workers*400
€/hour). The first hour of the shift the inflow is reduced. The L (number of workers
in the system) is 5. Office employee cost is 2000 €/day. If another employee is working
(model M/M/2) the worker cost is 2823.53 €/day (L=1.0084) and of the employees
4000 €/day. Clearly, it is profitable to hire two employees for the system.

SOLUTION OF PROBLEM 5
This is a M/M/1 system with finite population m=4, with 𝜆 = 1 plane per year, and 𝜇
= 8 planes per year.
Se trata de un sistema cerrado de colas de tipo M/M/1 con tamaño de la fuente
m = 4 aviones con tasa de llegada individual de cada avión l = 1 avión/año y tasa
de salida m = 8 aviones/año . El factor de utilización es
l 1
r= =
m 8
Las probabilidades de cada estado se pueden calcular mediante estas expresiones
-1
é m
m ! rn ùú é 4! 4! 4! 4! ù
-1

p0 = 1 + å
ê = ê1 + + + + ú =
ê ú
n =1 (m - n )! û ëê 3 !8 2 ! 82 1! 83 0 ! 84 ûú
ë
é 1 3 3 3 ù-1
= ê1 + + + + ú = 0.5746
ëê 2 16 64 512 ûú

pn = (m - n + 1)r pn -1

p1 = 4r p0 = 0.2873 ; p2 = 3rp1 = 0.1077 ; p3 = 2rp2 = 0.0269 ; p4 = r p3 = 0.0034

El número medio de aviones en el sistema es
1 - p0
L =m- = 4 - (1 - 0.5746)8 = 0.5971 aviones
r
La tasa media de llegada de los aviones al sistema lEF = (m - L )l = 3.4029 .
El número medio de aviones en cola en espera para ser reparados es

November 2019
 QUEUEING THEORY

1+r 9
Lq = m - (1 - p0 ) = 4 - 8 (1 - 0.5746) = 0.1717 aviones
r 1
8
que también se podía haber calculado como
lEF 3.4029
Lq = L - = 0.5971 - =0.1717 aviones
m 8
El tiempo medio de aviones en el sistema es
L 0.5971
W = = = 0.1678 años = 61.2 días
(m - L)l (4 - 0.5971)1
y el tiempo medio de aviones en cola es
Lq 0.1717
Wq = = = 0.0501 años = 18.3 días
(m - L )l (4 - 0.5971)1

SOLUTION OF PROBLEM 6
This is a M/M/1 system with infinite population, with 𝜆 = 8 customers per hour, and 𝜇
= 12 customers per hour.

a) Wq = 0.16 hours = 10 min.

b) Lq = 1.3 customers.
c) The average queue length when the queue is not empty, is calculated by
Lq/prob(queue not empty). This probability = 1- p0 – p1. Finally, the queue length
(when it is not empty) is 3 people. And the probability that there are at least 2 people

in the system is 0.4 .

SOLUTION OF PROBLEM 7
This is a M/M/2 system with finite population m=4, with 𝜆 = 1/3 machine per hour,
and 𝜇 = 4/3 machines per hour.
L=0.2537 máquinas en el taller.

SOLUTION OF PROBLEM 8
This is a M/M/2 system with infinite population, with 𝜆 = 100 customers per hour, and
𝜇 = 60 customers per hour
a) 1 - p0 - p1 - p2 - p3 = 0.5261 .
b) P (al menos un cajero ocioso) = 0.24.

SOLUTION OF PROBLEM 9
a) L=3.285.
b) 0.96 es el número medio de vehículos que no pueden entrar al servicio.

SOLUTION OF PROBLEM 10

November 2019 15
QUEUEING THEORY

a) p0 =0.1526, Lq =0.0283, L=1.9033, Wq =0.0019 horas=7 s, W=0.1269 horas =

7min.36 s
c) p 0 =0.03226, Lq =13.61, L=15.49, Wq = 0.90733 horas=54.44min., W=1.03 horas =
61.8min.

SOLUTION OF PROBLEM 11
a) L=2.4 empleados en el departamento de control de calidad.
b) L=1.4778 empleados en el departamento de control de calidad.

SOLUTION OF PROBLEM 12
The first system is a M/M/1 system with infinite population, with 𝜆 = 10 customers per
hour, and 𝜇 = 12 customers per hour. The second system (with the course) corresponds
to a M/G/1 system.
a) Current employee: L = 5 customers, W = 30 minutes
Employee with the course: L = 8.625 customers, W = 51.750 minutes. The results
are more sensitive to the average service time than to the variance.
b) It is not possible to compensate for the 0.5 minute increase in service time with
reducing the variance. Even if the variance were 0, the resulting L would still be
higher than 5, so only with a negative variance (which does not exist) could the same
L=5 be obtained).

SOLUTION OF PROBLEM 13
L=2.9583 máquinas.

SOLUTION OF PROBLEM 14
Wq = 2.28 minutos.

SOLUTION OF PROBLEM 15
a) L= 39/760 pacientes.
b) W= 15 min. y 23 s
c) Wq = 23 s
d) Lq = 1/760 pacientes.

SOLUTION OF PROBLEM 16
El coste por trabajo por unidad de incremento de m (100 sentencias por minuto) por
unidad de tiempo (día) = 0.05 u.m.
El coste por retrasar un trabajo un día es 10 u.m.
l = 50 trabajos por día
De aquí se deduce que el m óptimo es 123 trabajos por día, es decir 256 sentencias
por minuto.

SOLUTION OF PROBLEM 17

November 2019
 QUEUEING THEORY

El coste del primer empleado, suponiendo que estuviera él solo, es de 35 u.m./hora.

El coste del segundo empleado es de 13 u.m./hora. Es más económico el segundo.

SOLUTION OF PROBLEM 18
a) Se trata de un sistema cerrado de colas de tipo M/M/1 con tamaño de la fuente
m = 4 máquinas con tasa de llegada individual de cada máquina
l = 0.1 máquinas/hora y tasa de salida m = 0.5 máquinas/hora . El factor de
utilización es
l
r= = 0.2
m
Las probabilidades de cada estado se pueden calcular mediante estas expresiones
-1
é m
m ! rn úù é 4! 4! 4! 4! ù
-1

p0 = ê1 + å = ê1 + + + + ú =
ê ú
n =1 (m - n )! û êë 3 !5 2 ! 52 1! 53 0 ! 54 úû
ë
-1
é 4 12 24 24 ù
= ê1 + + + + ú = 0.3983
êë 5 25 125 625 úû

pn = (m - n + 1)r pn -1

p1 = 4r p0 = 0.3187 ; p2 = 3r p1 = 0.1912 ; p3 = 2rp2 = 0.0765 ; p4 = rp3 = 0.0153

b) El número medio de máquinas en el sistema es
1 - p0
L =m- = 4 - (1 - 0.3983)5 = 0.9917 máquinas
r
Luego el número de máquinas operativas es aproximadamente 3.
La tasa media de llegada de las máquinas al sistema lEF = (m - L )l = 0.3008 .
El número medio de máquinas en cola en espera para ser reparadas es
lEF 0.3008
Lq = L - = 0.9917 - =0.3900 máquinas
m 0.5
El tiempo medio de máquinas en el sistema es
L 0.5971
W = = = 0.1678 años = 61.2 días
(m - L )l (4 - 0.5971)1

y el tiempo medio de máquinas en cola es

Lq 0.1717
Wq = = = 0.0501 años = 18.3 días
(m - L )l (4 - 0.5971)1

c) El coste medio total por día es 20 ⋅ 8 ⋅ 0.9917 + 45 = 203.67 u.m./día

November 2019 17
QUEUEING THEORY

d) En el caso de tener dos mecánicos es equivalente a dos sistemas cerrados de colas

M/M/1 de fuente con tamaño m = 2 máquinas y tasa de llegada
l = 0.1 máquinas/hora y tasa de salida m = 0.5 máquinas/hora . El factor de
utilización sigue siendo r = 0.2
Las probabilidades de cada estado se pueden calcular mediante estas expresiones
-1
é m
m ! rn ùú é 2! 2! ù
-1

p0 = ê1 + å = ê1 + + ú 
= 0.675
ê ú
n =1 (m - n )! û êë 1!5 0 !52 úû
ë

 ; p2 = r p1 = 0.135
p1 = 2r p0 = 0.270 

El número medio de máquinas en el sistema es

1 - p0  = 0.378
 máquinas
L =m- = 2 - (1 - 0.675)5
r
 + 45) = 211.08 u.m./día
El coste medio total por día es 2(20 ⋅ 8 ⋅ 0.378

e) En el caso de tener dos mecánicos para las cuatro máquinas es equivalente a un

sistema cerrado de colas M/M/2 de fuente con tamaño m = 4 máquinas y tasa de
llegada l = 0.1 máquinas/hora y tasa de salida m = 0.5 máquinas/hora . El
factor de utilización ahora es r = l cm = 0.1 . Las probabilidades se pueden calcular
a partir de la expresión
ì æm öæ
n
ïï çç ÷÷ çç l ÷ö÷ p
ï
1£n £c
ïï èç n ø÷÷ èç m ø÷÷ 0
pn = ïím
ï
ï æ ö n !(l / m)n
ïïçç ÷÷÷ p0 c £ n £ m
ïèç n ø÷ c ! c n -c
ï
î

p1 = 0.8p0 ; p2 = 0.24 p0 ; p3 = 0.048p0 ; p4 = 0.0048p0

de donde resulta p0 = 0.4778 , p1 = 0.3823 , p2 = 0.1147 , p3 = 0.0229 , p4 = 0.0002
y el número medio de máquinas en el sistema es

L = 0 ⋅ 0.4778 + 1 ⋅ 0.3823 + 2 ⋅ 0.1147 + 3 ⋅ 0.0229 + 4 ⋅ 0.0002 = 0.6896 máquinas

El coste medio total por día es 20 ⋅ 8 ⋅ 0.6896 + 2 ⋅ 45 = 200.34 u.m./día
Resulta ser el sistema más económico.

SOLUTION OF PROBLEM 19
Con un mecánico se obtiene un coste de 140 u.m. y con dos de 152 u.m.

SOLUTION OF PROBLEM 20
Coste actual por hora = 2456.62. Coste con aerosol = 1891.55. Coste con dos
servidores = 1389.43. Resulta preferible poner dos servidores.

November 2019
 QUEUEING THEORY

SOLUTION OF PROBLEM 21
a) La tasa óptima es de 14.47 radios por día, con un coste diario de 378.43225 €.
b) En este caso se obtiene un coste diario de 395.184, que es peor.

SOLUTION OF PROBLEM 22
Aplicando el modelo general ya que las distribuciones son exponenciales, pero la tasa
de servicio varía según el número de clientes que haya en el sistema, se obtiene:
p0 =0.264, p1 =0.1983, p2 =0.1653, p3 =0.1653, p4 =0.2066

SOLUTION OF PROBLEM 23
1. l = 1/ 5 trabajos/minuto
2. Sí, pues r = 3 / 4 < 1
3. p0 = 1/ 7 y por lo tanto L = 24 / 7 = 3.4286 trabajos
15
4. Tasa de atención cm = 4 /15 trabajos por minuto, entonces 3.4286 = 12.857
4
minutos
5. Coste/h = 20L = 68.572 €/h
20 10 L 10 3.4286
6. Coste total por trabajo = 10 W = = = 57.1433 €
60 3 l 3 0.2

SOLUTION OF PROBLEM 24
Coste/h = Coste amortización + Coste operativo ( 1 - p0 ) + Coste clientes L
5 5/6
Coste robot 1 = 100 + 200 + 80 = 666.66 €/h
6 1/ 6
5 5/7
Coste robot 2 = 150 + 400 + 80 = 635.7143 €/h
7 2/7
Es más barato el segundo robot.

SOLUTION OF PROBLEM 27
a) Se trata de un Problem que mezcla teoría de la decisión y de colas.
P(3º B) = 0.75; P(3º R) = 0.25; P(3º B/2º B) = 0.8; P(3º B/2º R) = 0.3
De estos valores se puede deducir P(3º R/2º B) = 0.2; P(3º R/2º R) = 0.7
P(3º B) = 0.75 = P(3º B/2º B) P(2º B) + P(3º B/2º R) P(2º R) =
= 0.8 P(2º B) + 0.3 (1 - P(2º B))
P(2º B) = 0.45/0.5 = 0.9; P(2º R) = 1 - 0.9 = 0.1
La opción más económica es alquilar la máquina en el primer trimestre.

b) El proceso de llegada a las máquinas puede tener l = 8 piezas/día para la demanda

regular o l = 12 piezas/día para la demanda buena. Las tasas de servicio son
mA = 16 piezas/día y mB = 10 piezas/día. El sistema de colas es M/M/1 para cada
máquina.

November 2019 19
QUEUEING THEORY

8 8
Para la demanda regular se tiene r1 =
= 0.5 y r2 = = 0.8 .
16 10
1 1 1 1
W1 = = = 0.125 día y W2 = = = 0.5
m1(1 - r1 ) 16(1 - 0.5) m2 (1 - r2 ) 10(1 - 0.8)
día.
Luego en este sistema el tiempo total en el sistema es de 0.625 días.
Para el caso de la demanda buena es necesario instalar dos máquinas B en paralelo
para poder satisfacer la demanda. Entonces es un sistema de colas M/M/1 para la
12
máquina A y M/M/2 para la B. Para la demanda buena se tiene r1 = = 0.75 y
16
12 1 1
r2 = = 0.6 . Para la máquina A W1 = = = 0.25 día.
2 ⋅ 10 m1(1 - r1 ) 16(1 - 0.75)
1
Para la máquina B p0 = 2 = 0.25 ,
(2 ⋅ 0.6)
+ 1 + 2 ⋅ 0.6
2!(1 - 0.6)
(1.2)2 0.6 L 1.875
L2 = 2
0.25 + 1.2 = 1.875 W2 = 2 = = 0.15625 día.
2(1 - 0.6) l2 12
Luego en este sistema el tiempo total en el sistema es de 0.40625 días.

SOLUTION OF PROBLEM 28
a) Tiempo medio de un artículo en C1:
1art 60
lC 1 = 15art/h mC 1 == art/h = 20art/h
3min 3
15
Modelo M/M/1: r = = 0.75 < 1
20
1 1
WC 1 = = = 1/ 5h = 12min LC 1 = lC 1WC 1 = 15 ⋅ 1/ 5 = 3
m(1 - r) 20 ⋅ 0.25
Tiempo medio de un artículo en C2:
2 1art 60
lC 2 = 15 = 10art/h mC 1 = = art/h = 6art/h
3 10min 10
10
Modelo M/M/2: r = = 5/6 < 1
12
1 1
p0 = 2 = = 1/11
(5 / 3) 25 / 3 + 3 / 3 + 5 / 3
+ 1 + 5/ 3
2 ⋅ 1/ 6
(5 / 3)2 5 / 6 180
LC 2 = 2
1/11 + 5 / 3 = = 5.46
2 ⋅ 1/ 6 33
L 180 / 33
WC 2 = C 2 = = 18 / 33h = 32.72min
lC 2 10
Tiempo medio de un artículo en C3:
1 1art 60
lC 3 = 15 = 5art/h mC 1 = = art/h = 8art/h
3 7.5min 7.5
Modelo M/G/1: r = 5 / 8 < 1

November 2019
 QUEUEING THEORY

sC2 3 = 4 / 602
(5 / 8)2 + 52 ⋅ 4 / 602 511
LC 3 = 5 / 8 + =
2 ⋅ 3/8 432
L 511/ 432
WC 3 = C 3 = = 0.2366h = 14.19min
lC 3 5
Tiempo proceso A: 12 min + 32.72 min = 44.72 min
Tiempo proceso B: 12 min + 14.19 min = 26.19 min

b) El coste horario del sistema es

0.1€/min ⋅ 60min/h(LC 1 + LC 2 + LC 3 ) = 6(3 + 180 / 33 + 511/ 432) = 57.82 €/h
El coste imputable a los productos procesados según A:
0.1€/min(WC 1 + WC 2 ) = 0.1 ⋅ 44.72 = 4.47€/art
El coste imputable a los productos procesados según B:
0.1€/min(WC 1 + WC 3 ) = 0.1 ⋅ 26.19 = 2.619€/art

SOLUTION OF PROBLEM 29
El empresario se encuentra a comienzos de junio ante tres posibles alternativas:

1. Contratar un equipo de tres mecánicos para los tres meses de verano,

2. Contratar dos equipos de tres mecánicos para todo el verano, o
3. Contratar en junio un equipo y otro más en julio.

Los costes asociados a las tres decisiones son respectivamente de 45000, 90000 y 95000
€. Posteriormente, en el mes de julio, el azar juega su papel modificando al alza, l = 24
, o a la baja, l = 6 , la tasa diaria de llegadas de motos averiadas, con probabilidades
respectivas de 0.75 y 0.25.
Todo ello se refleja en el siguiente árbol de decisión.

November 2019 21
QUEUEING THEORY

 julio  24 1

0.75

A1 0.25 2
a
r
pa ano
 julio  6
o
p e r
ui l v € 3
q
e oe 00  julio  6
1 d
to 4 50
- 1equipo para junio y 2 0.25
para el resto del verano
D1 A2
-9 - 95000 €
2 00 0.75
e
to qu 00
d oi p €  julio  24
el o s
ve pa
ra ra  julio  24 4
no A3
0.75 5

106340 €
0.25
 julio  6

Dependiendo de la decisión tomada y de la evolución de las tasas se obtienen

diferentes ingresos. Para calcularlos, hay que considerar que nos encontramos con
diferentes modelos de colas, todos ellos del tipo M/M/s/4, donde s toma los valores 1 ó
2, con  = 12, y  = 12, 24 ó 6.
El punto clave es determinar la proporción de motos que no podrán ser atendidas,
proporción que viene dada por la probabilidad de que el taller se encuentre lleno, es decir,
la probabilidad p4 de que la cola se encuentre en el estado 4. De acuerdo con las fórmulas
correspondientes a este modelo tenemos que

a) s = 1
n
1 æl ö
p0 = 4 n , pn = çç ÷÷÷ p0
æ l ÷ö
çç ÷ èç m ÷ø
å ç ÷
n =0 è m ø

Por tanto:
l
1. Si  = 12, = 1  p0 = 0.2  p4 = 0.2 lEF = 9.6
m
l 1 16
2. Si  = 24, = 2  p0 =  p4 = lEF = 11.613
m 31 31

November 2019
 QUEUEING THEORY

l 16 1
3. Si  = 6, = 0.5  p0 =  p4 = lEF = 5.807
m 31 31

b) s = 2
n
1 ælö
p0 = n , pn = 2 çç ÷÷÷ p0 (n > 1)
l 3 ælö çè 2m ÷ø
1 + å çç ÷÷
m n =0 çè 2m ÷ø
Por tanto:
l 8 1
4. Si  = 12, = 1  p0 =  p4 = lEF = 11.478
m 23 23
l 1 2 
5. Si  = 24, = 2  p 0 =  p4 = lEF = 18.6
m 9 9
l 128 1
6. Si  = 6, = 0.5  p0 =  p4 = lEF = 5.972
m 213 213

Con estos datos, los ingresos esperados son los siguientes:

1. si decide contratar un solo equipo para todo el verano son:

a. Durante el primer mes del verano llegan en promedio 360 motos, de las que son
atendidas el 80 %. Los ingresos durante este mes son de 360 ⋅ 0.8 ⋅ 65 = 18720 €
.
b. Durante los otros dos meses, si la tasa de motos sube a 24, sólo es atendida una
proporción del 15/31 de las 60 ⋅ 24 = 1440 motos que llegan en promedio, lo que
supone unos ingresos adicionales para esos 2 meses de
1440 ⋅ (15 / 31) ⋅ 65 = 45290 € . Esto da unos ingresos totales para toda la
campaña de 64010 €.
c. Si la media de motos desciende a 6, es atendida una proporción de 30/31, lo que
se traduce en unos ingresos durante estos dos meses de
60 ⋅ 6 ⋅ (30 / 31) ⋅ 65 = 22645 € y unos ingresos globales de 41365 €.

2. si decide contratar dos equipos para todo el verano son:

a. Durante el primer mes del verano llegan en promedio 360 motos, de las que son
atendidas la proporción 22/23. Los ingresos durante este mes son de
360 ⋅ (22/23) ⋅ 65 = 22383 €
b. Durante los otros dos meses, si la tasa de motos sube a 24, sólo es atendida una
proporción del 7/9 de las 60 ⋅ 24 = 1440 motos que llegan en promedio, lo que
supone unos ingresos adicionales para esos 2 meses de
1440 ⋅ (7 / 9) ⋅ 65 = 72800 € . Esto da unos ingresos totales para toda la campaña
de 95183 €.

November 2019 23
QUEUEING THEORY

c. Si la media de motos desciende a 6, son atendidas prácticamente todas 212/213,

lo que se traduce en unos ingresos durante estos dos meses de
60 ⋅ 6 ⋅ 65 = 23400 € y unos ingresos globales de 45783 €.

3. si decide contratar un equipo al comienzo y otro más en julio

a. Durante el primer mes del verano llegan en promedio 360 motos, de las que son
atendidas el 80 %. Los ingresos durante este mes son de 360 ⋅ 0.8 ⋅ 65 = 18720 €
.
b. Durante los otros dos meses, si la tasa de motos sube a 24, sólo es atendida una
proporción del 7/9 de las 60 ⋅ 24 = 1440 motos que llegan en promedio, lo que
supone unos ingresos adicionales para esos 2 meses de
1440 ⋅ (7 / 9) ⋅ 65 = 72800 € . Esto da unos ingresos totales para toda la campaña
de 91520 €.
c. Si la media de motos desciende a 6, son atendidas prácticamente todas, lo que se
traduce en unos ingresos durante estos dos meses de 60 ⋅ 6 ⋅ 65 = 23400 € y unos
ingresos globales de 42120 €.

Con estos datos la valoración de las distintas hojas del árbol queda reflejada en la
siguiente figura

64000 €
 julio  24 1

0.75
0.25 41394 €
A1 2 42120 €
ra  julio  6
pa ano
o
p e r
ui l v € 3
q
e oe 00  julio  6
1 d 0
to - 45 1equipo para junio y 2
0.25
para el resto del verano
D1 A2
- 95000 €
2 -9 0.75
to equ 00
d o ip 00  julio  24
o
el s €
ve pa
ra ra  julio  24 4
no A3
0.75 5 96100 € 91520 €

0.25
 julio  6

6 46800 €

November 2019
 QUEUEING THEORY

Pasamos a valorar los vértices del árbol. Los de azar con el valor medio ponderado
de los valores asociados a los vértices extremos de arcos que salen de ellos y ya estén
valorados. Los de decisión, eligiendo la alternativa de mayor valor esperado. Esto nos
lleva a que la decisión óptima es la de contratar un solo equipo para toda la campaña
con una ganancia esperada de 13349 €.

64000 €
 julio  24 1

58348 € 0.75
0.25 41394 €
A1 2 42120 €
ra  julio  6
pa ano
o
p e r
ui l v € 3
eq o e 0 0  julio  6
1 d 50
to - 4 1equipo para junio y 2 0.25
para el resto del verano
D1 A2
- 95000 €
2 -9 79170 € 0.75
to equ 00
d o ip 00  julio  24
el so €
ve pa
ra ra  julio  24 4
no A3
0.75 5 96100 € 91520 €
83775 €
0.25
 julio  6

6 46800 €
El último apartado pide calcular el VEIP, es decir, la diferencia entre la ganancia
esperada si se supiera el futuro y la ganancia esperada bajo riesgo.
Si se superiera que la tasa de llegadas para los dos últimos meses va a ser l = 24 y
se toma la decisión óptima, la ganancia sería el máximo entre 19010, –3480 y 6100, es
decir, 19010 €. Si se supiera que la tasa es l = 6 entonces la decisión óptima es el máximo
entre –3635, –52880, –43200, es decir, –3635 €. La ganancia esperada con información
perfecta es 19010 ⋅ 0.75 - 3635 ⋅ 0.25 = 13349 €. La ganancia bajo riesgo es de 13349 €.
Luego el VEIP es la diferencia entre ambos que, en este caso, es 0. Este resultado se
produce por la coincidencia en la decisión óptima, la primera, tanto cuanto la tasa es
l = 24 , como cuando es l = 6 como bajo riesgo.

SOLUTION OF PROBLEM 30
a) La variable de estado son los vehículos en el taller principal y en el anexo.
b)

November 2019 25
QUEUEING THEORY

0 1 2
0 1 2 3
1 2 3
l2l1l0 ll l
p3 = p0 , p2 = 1 0 p0 , p1 = 0 p0 , p3 + p2 + p1 + p0 = 1
m3 m2 m1 m2 m1 m1
l2 = l1 = l0 = l , ln = 0 n ³ 3 , m3 = u2 + u1, m2 = m1 = u1 ,
c) p0 = p1 = p2 = 2 / 7  0.286 , p3 = 1/ 7  0.143
d) La probabilidad de no poder ser reparado en el taller principal ni en el anexo es
p3  0.143 .
e) d = l(1 - p3 ) = 6(6 / 7)  5.143 piezas/hora, cp = 500 €, ca = 4 /(9 ⋅ 250)
€/pieza y hora, l = 16 días.
2 ⋅ 5.143 ⋅ 500
Q* = 9 ⋅ 250  1700.86 piezas.
4
T0 = 1700.86 / 5.143 = 330.71h / 9  36.7 días y punto de reorden
ld = 16 ⋅ 5.143 ⋅ 9 = 740.592 piezas.

SOLUTION OF PROBLEM 31
¿Cuántos administrativos serán necesarios que estén en la oficina B si se desea que
la probabilidad de una espera superior a los 10 minutos sea inferior a 0.05?
Dados los sistemas A y B enlazados en serie, si el primer sistema A recibe los usuarios
según una ley poissoniana con tasa de llegada lA y dicho sistema es estable, el sistema
B que recibe usuarios del sistema A los recibe según un proceso poissoniano de tasa de
llegada lA . En la siguiente figura se representa los dos sistemas enlazados con sus tasas
de entrada y salida suponiendo que ambos sistemas, A y B, son estables.
A B
A A A
A B

El valor de la tasa de entrada al sistema A es de 12 personas/hora. Al ser la tasa de

servicio de dicho sistema de 15 personas/hora (60/4) el sistema A resulta ser estable. El
sistema B con un solo administrativo no sería estable ya que la tasa de servicio es de 8
personas/hora frente a una tasa de llegada de 12 personas/hora. Por lo tanto, con dos
administrativos el sistema B sí sería estable.
El cálculo de la probabilidad de que exista un tiempo de espera superior a 10 minutos
para dos administrativos en el sistema B se calcula como:
l 12
F= = = 0.75
Sm 2 ⋅ 8

November 2019
 QUEUEING THEORY

1 1
p0 = S n = 2 = 0.142857
(S F) S -1
(S F) (2 ⋅ 0.75) 2 ⋅ 0.75
+å +1+
S ! (1 - F) n =0 n ! 2! (0.25) 1

S 2
(S F) (2 ⋅ 0.75)
P (tc > 0) = p0 = 0.142857 = 0.64285
S ! (1 - F) 2!⋅ 0.25

æ 10 ö
P ççtc > ÷÷ = e -S mx (1-F)P (tc > 0) = e -2⋅8⋅ 6⋅0.250.64285 = 0.33
1

è 60 ø
Al ser la probabilidad mayor de 0.05 el número de administrativos ha de
incrementarse para evaluar la probabilidad de que el tiempo de espera supere los 10
minutos con tres administrativos.
l 12
F= = = 0.5
Sm 3⋅8

1 1
p0 = S n = 3 2 = 0.21
(S F) (S F)
S -1
(3 ⋅ 0.75) 3 ⋅ 0.5 (3 ⋅ 0.5)
+å +1+ +
S ! (1 - F) n =0 n ! 3! (0.5) 1 2!

S 2
(S F) (3 ⋅ 0.5)
P (tc > 0) = p0 = 0.21 = 0.23625
S ! (1 - F) 3!⋅ 0.5

æ 10 ö
P ççtc > ÷÷ = e -S mx (1-F)P (tc > 0) = e -3⋅8⋅ 6⋅0.50.23625 = 0.03197
1

è 60 ø
Con tres administrativos se obtiene que sólo el 3 % de las personas que acceden al
sistema B van a tener un tiempo de espera superior a 10 minutos.

November 2019 27