Erlang Arrivals, Erlang Service (E2/E2/1)
This chapter pertains to a one-server system with finite capacity, and with Erlang 2-stage inter-arrival and service times. Could be a furniture store where, on each sale, the store has a stockman who fetches the item in the back storage area of the store, brings it to the customer’s vehicle and helps to load the item in the vehicle. In this situation, the stockman is the service facility. Matrix methods are used to compute the probability of n units in the system. The probabilities are used to calculate the performance measures. The chapter shows how to extend the matrix method for an infinite capacity system.