Erlang Arrivals, Erlang Service (E2/E2/1)

  • Nick T. Thomopoulos


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.


Service Time Equilibrium Equation Service Level Matrix Method Expected Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  1. 1.Stuart School of BusinessIllinois Institute of TechnologyChicagoUSA

Personalised recommendations