Question

1. Given a P matrix for a discrete time Markov chain consisting of transient and absorbing states, list the steps you would take to determine the probability of ending in a certain absorbing state given the current transient state.

2. For an M/M/1/GD/∞/∞ queuing system with arrival rate λ = 5 customers per hour and service rate μ = 15 customers per hour, on the average, how long (in minutes) does a customer wait in line (round off to 3 decimal digits)?

3. For an M/M/1/GD/c/∞ queuing system with arrival rate λ = 20 customers per hour, service rate μ = 10 customers per hour and a total capacity of 5 customers, what is the effective arrival rate (round off to 3 decimal digits)?

4. For an M/M/s/GD/∞/∞ queuing system with 2 servers of service rate μ = 30 customers per hour per server and arrival rate λ = 46 customers per hour, on the average, how many customers are in the system (round off to 3 decimal digits)?  

5. A local hospital award accepts an average of 1,200 patients per year. On the average, 16 beds in the hospital ward are filled. On the average, how many days does a patient stay in the hospital ward (round off to 3 decimal digits)?

NEED ANSWERS ASAP

Answer 1