Abstract
This chapter explores a one-server system with infinite capacity, exponential inter-arrival times and Erlang 2-stage service times. Could be a jogging shoe manufacturer that uses a mold (called a last) to produce a shoe of a certain size and width. The arrival time between demands for the mold is exponential, and the time to use the mold on the shoe is Erlang. For an infinite capacity system, the performance measures are generated. For a finite capacity system, matrix methods are introduced and the chapter shows how to compute the probability of n units in the system, and also the performance measures. The chapter also shows how to extend the matrix method to compute the probabilities for an infinite capacity system. Examples are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Thomopoulos, N.T. (2012). Exponential Arrivals, Erlang Service (M/E2/1). In: Fundamentals of Queuing Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3713-0_19
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3713-0_19
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-3712-3
Online ISBN: 978-1-4614-3713-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)