# Question: Consider a generalization of the M M 1 model where the server

Consider a generalization of the M/M/1 model where the server needs to “warm up” at the beginning of a busy period, and so serves the first customer of a busy period at a slower rate than other customers. In particular, if an arriving customer finds the server idle, the customer experiences a service time that has an exponential distribution with parameter μ1. However, if an arriving customer finds the server busy, that customer joins the queue and subsequently experiences a service time that has an exponential distribution with parameter μ2, where μ1 < μ2. Customers arrive according to a Poisson process with mean rate λ.

(a) Formulate this model in terms of transitions that only involve exponential distributions by defining the appropriate states and constructing the rate diagram accordingly.

(b) Develop the balance equations.

(a) Formulate this model in terms of transitions that only involve exponential distributions by defining the appropriate states and constructing the rate diagram accordingly.

(b) Develop the balance equations.

## Answer to relevant Questions

For each of the following models, write the balance equations and show that they are satisfied by the solution given in Sec. 17.6 for the steady-state distribution of the number of customers in the system. (a) The M/M/1 ...For the finite queue variation of the M/M/1 model, develop an expression analogous to Eq. (1) in Prob. 17.6-17 for the following probabilities: (a) P {W > t}. (b) P {Wq > t}. Marsha operates an expresso stand. Customers arrive according to a Poisson process at a mean rate of 30 per hour. The time needed by Marsha to serve a customer has an exponential distribution with a mean of 75 seconds. (a) ...A company has one repair technician to keep a large group of machines in running order. Treating this group as an infinite calling population, individual breakdowns occur according to a Poisson process at a mean rate of 1 ...Consider the queueing model with a preemptive priority queue discipline presented in Sec. 17.8. Suppose that s = 1, N = 2, and (λ1 + λ2) < μ and let Pij be the steady-state probability that there are i members of the ...Post your question