A service company receives on average 4 service requests per day. The requests are received randomly according to Poisson process. The company has 2 service engineers and sends one engineer to attend each request. An engineer needs an exponentially distributed service time with the mean of day(s). The company's policy is to have maximum of 2 requests waiting in the queue If this number is reached, all incoming requests are rejected (sent to a competitor).

Glencoe Algebra 1, Student Edition, 9780079039897, 0079039898, 2018
18th Edition
ISBN:9780079039897
Author:Carter
Publisher:Carter
Chapter10: Statistics
Section10.6: Summarizing Categorical Data
Problem 10CYU
icon
Related questions
Topic Video
Question
A service company receives on average 4 service requests per day.
The requests are received randomly according to Poisson process.
The company has 2 service engineers and sends one engineer to attend each request.
1
An engineer needs an exponentially distributed service time with the mean of
day(s).
2
The company's policy is to have maximum of 2 requests waiting in the queue
If this number is reached, all incoming requests are rejected (sent to a competitor).
Answer the following questions based on the information provide above:
(a) Using the Kendall's notation, indicate what type of queueing system it is:
(b) Compute the system state probabilities (provide at least 3 decimals):
Po =
P1=
P2 =
P3 =
Pa =
(c) Compute the expected total number of customer requests (waiting and served) in the system.
ELL] =
(d) Compute the expected number of accepted requests.
Aaccepted =
(e) Compute the expected total processing time (waiting + being served) for the accepted requests.
E[Time] =
Transcribed Image Text:A service company receives on average 4 service requests per day. The requests are received randomly according to Poisson process. The company has 2 service engineers and sends one engineer to attend each request. 1 An engineer needs an exponentially distributed service time with the mean of day(s). 2 The company's policy is to have maximum of 2 requests waiting in the queue If this number is reached, all incoming requests are rejected (sent to a competitor). Answer the following questions based on the information provide above: (a) Using the Kendall's notation, indicate what type of queueing system it is: (b) Compute the system state probabilities (provide at least 3 decimals): Po = P1= P2 = P3 = Pa = (c) Compute the expected total number of customer requests (waiting and served) in the system. ELL] = (d) Compute the expected number of accepted requests. Aaccepted = (e) Compute the expected total processing time (waiting + being served) for the accepted requests. E[Time] =
Expert Solution
steps

Step by step

Solved in 6 steps

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, statistics and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Glencoe Algebra 1, Student Edition, 9780079039897…
Glencoe Algebra 1, Student Edition, 9780079039897…
Algebra
ISBN:
9780079039897
Author:
Carter
Publisher:
McGraw Hill
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Big Ideas Math A Bridge To Success Algebra 1: Stu…
Algebra
ISBN:
9781680331141
Author:
HOUGHTON MIFFLIN HARCOURT
Publisher:
Houghton Mifflin Harcourt
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Holt Mcdougal Larson Pre-algebra: Student Edition…
Holt Mcdougal Larson Pre-algebra: Student Edition…
Algebra
ISBN:
9780547587776
Author:
HOLT MCDOUGAL
Publisher:
HOLT MCDOUGAL