Question: For the single-server queuing system in exercise 1b, suppose the queue has room for only three customers and that a customer arriving to find that the queue is full just goes away (i.e., the customers balk if there are three customers in the queue). Simulate this process for 5000 min, and estimate the same quantities as in part (b) of exercise 1, as well as the expected number of customers who balk.

Exercise: Consider a single-server queuing system for which the interarrival times are exponentially distributed. A customer who arrives and finds the server busy joins the end of a single queue. Service times of customers at the server are also exponentially distributed random variables. Upon completing service for a customer, the server chooses a customer from the queue (if any) in a FIFO manner:

a. Simulate customer arrivals assuming that the mean interarrival time equals the mean service time (e.g., consider that both of these mean values are equal to 1 min). Create a plot of number of customers in the queue (y-axis) versus simulation time (x-axis). Is the system stable? (Hint: Run the simulation long enough [e.g., 10,000 min] to be able to determine whether or not the process is stable.)

b. Consider now that the mean interarrival time is 1 min and the mean service time is 0.7 min. Simulate customer arrivals for 5000 min and calculate

(i) the average waiting time in the queue,

(ii) the maximum waiting time in the queue,

(iii) the maximum queue length,

(iv) the proportion of customers having a delay time in excess of 1 min, and

(v) c.