Scribd
Upload
930 views3 pages

Queuing Ex Solutions

1. The document describes three queueing systems: - A machine repair crew with a utilization rate of 37.5% and average downtime of 0.2 days. - A car wash with an average line of 4.167 cars and average wait time of 0.4167 hours. - A movie theater ticket line with an average wait of 2.25 patrons and cashier utilization of 75%.

Uploaded by

Ivan Valdivia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
930 views3 pages

Queuing Ex Solutions

1. The document describes three queueing systems: - A machine repair crew with a utilization rate of 37.5% and average downtime of 0.2 days. - A car wash with an average line of 4.167 cars and average wait time of 0.4167 hours. - A movie theater ticket line with an average wait of 2.25 patrons and cashier utilization of 75%.

Uploaded by

Ivan Valdivia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

SOLUTIONS

1. The Rockwell Electronics Corporation retains a service crew to repair machine


breakdowns that occur on an average of  = 3 per day (approximately Poisson in nature).
The crew can service an average of µ = 8 machines per day, with a repair time
distribution that resembles the exponential distribution.
(a) What is the utilization rate of this service system?
(b) What is the average downtime for a machine that is broken?
(c) How many machines are waiting to be serviced at any given time?
(d) What is the probability that more than one machine is in the system? Probability
that more than two are broken and waiting to be repaired or being serviced? More
than three? More than four?

a. The utilization rate, ,


 3
 8
= 0.375
b. The average down time, W,

1 1 = 0.2 day
W  8 3

c. The number of machines waiting to be served, Lq, is, on average,

Lq  2  32 = 0.225 machine waiting


 8  8  3

d. Probability that more than one machine is in the system


 k 1
3 2
9
P
nk
 
P
n1
 
  0.141
 8 64
Probability that more than two machines are in the system:
3
3 27
P
n2
 
  0.053
8 512
4
3 81
P
n3
 
  0.020
8 4, 096
5
3 243
P
n4
 
  0.007
8 32,768
2. From historical data, Harry’s Car Wash estimates that dirty cars arrive at the rate of
10 per hour all day Saturday. With a crew working the wash line, Harry figures that cars
can be cleaned at the rate of one every 5 minutes. One car at a time is cleaned in this
example of a single channel waiting line.
Assuming Poisson arrivals and exponential service times, find the
(a) average number of cars in line.
(b) average time a car waits before it is washed.
(c) average time a car spends in the service system.
(d) utilization rate of the car wash.
(e) probability that no cars are in the system.

 = 10 cars/hour,  = 12 cars/hour.
a. The average number of cars in line, Lq,
Lq  2  102  102 = 4.167 cars
 12 12 10 12  2

b. The average time a car waits before it is washed, Wq, is given by


Wq    10  10 = 0.4167 hour
      1212 10 12  2
c. The average time a car spends in the service system, W, is given by
W 1  1  1 hour
 12 2
10
d. The utilization rate, , is given by
 10
  12  0.8333
e. The probability that no cars are in the system, P0, is given by:

P0  1   1   1 0.8333  0.1667

3. Mike Dreskin manages a large Los Angeles movie theater complex called Cinema
I, II, III, and IV. Each of the four auditoriums plays a different film; the schedule is set
so that starting times are staggered to avoid the large crowds that would occur if all
four movies started at the same time. The theater has a single ticket booth and a
cashier who can maintain an average service rate of 280 movie patrons per hour.
Service times are assumed to follow an exponential distribution. Arrivals on a typically active
day are Poisson distributed and average 210 per hour. To determine the efficiency of the
current ticket operation, Mike wishes to examine several queue operating characteristics.
(a) Find the average number of moviegoers waiting in line to purchase a ticket.
(b) What percentage of the time is the cashier busy?
(c) What is the average time that a customer spends in the system?
(d) What is the average time spent waiting in line to get to the ticket window?
(e) What is the probability that there are more than two people in the system? More
than three people? More than four?
 = 210 patrons/hour,  = 280 patrons/hour.
a. The average number of patrons waiting in line, Lq, is given by
Lq  2  2102  44,100 = 44,100  2.25 patrons in line
 280  280  210 280  70 19, 600
b. The average fraction of time the cashier is busy, , is given by
 210
  280  0.75
c. The average time a customer spends in the ticket-dispensing system, W, is given by
W 1  1  1 = 0.0143 hour in the line
   280  210 70
d. The average time spent by a patron waiting to get a ticket, Wq, is given by
Wq    210  210 = 38.6 seconds
      280 280  210 280  70
e. The probability that there are more than two people in the system, Pn>2, is given by

P  k 1 P  210 3  0.422 n  k 
 n2 
280
The probability that there are more than three people in the system, Pn > 3, is given by
P 210 4  0.316 n3

280
The probability that there are more than four people in the system, Pn > 4, is given by
5
P  210  0.237
n4

280

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy