Question: M M ? 1 P 0 = 1 - , L = - M M ? s P 0 = 1 n = 0 s

MM?1
P0=1-,L=-
MM?s
P0=1n=0s-1()nn!+()ss!11-s
Lq=P0()ss!(1-)2,L=(Wq+1)=Lq+
MM?s
MM??sK
P0=1n=0s()nn!+()ss!n=s+1K(s)n-s
For n=1,2,dots,s,
Pn=()nn!P0;
n=s,s+1,dots,K,Pn=()ns!sn-sP0;
Lq=P0()ss!(1-)2[1-K-s-(K-s)K-s(1-)]
L=n=0s-1nPn+Lq+s(1-n=0s-1Pn)(20%) Consider a Jackson network with three service facilities having the parameter
values shown below.
(a) List all the equations that are required to find the total arrival rate at each of the
facilities. (5%)
Suppose that 1=10,2=30, and 3=15, answer the following 3 sub-questions.
(b) What is the probability that all the facilities have empty queues? (5%)
(c) Find the expected total waiting time for a customer. (5%)
(d) If we hire one more server for facility 3, suppose the expected number of customers
in facility 3 becomes 0.5. Suppose that the salary of each server is 200 dollars per
hour and the waiting cost is 10 dollars per hour for each customer. Is it a good idea
to hire one more server for facility 3?(5%)
 MM?1 P0=1-,L=- MM?s P0=1n=0s-1()nn!+()ss!11-s Lq=P0()ss!(1-)2,L=(Wq+1)=Lq+ MM?s MM??sK P0=1n=0s()nn!+()ss!n=s+1K(s)n-s For n=1,2,dots,s, Pn=()nn!P0;

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!