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

Nick T. Thomopoulos ()
Additional contact information
Nick T. Thomopoulos: Illinois Institute of Technology, Stuart School of Business

Chapter Chapter 20 in Fundamentals of Queuing Systems, 2012, pp 139-146 from Springer

Abstract: Abstract This chapter considers a one-server sytem with finite capacity, Erlang 2-stage inter-arrival times and exponential service times. An example is the trucks that arrive to a receiving dock with one unloading crew. As the trucks come in, the crew (the service facility) unloads each truck in the order of arrival. Matrix methods are used to compute the probability of n units in the system. The probabilities are used to derive the performance measures. The chapter shows how the matrix method can extend to an infinite capacity system. Examples are presented.

Keywords: Service Time; Equilibrium Equation; Matrix Method; Expected Number; Loss Probability (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-3713-0_20

Ordering information: This item can be ordered from
http://www.springer.com/9781461437130

DOI: 10.1007/978-1-4614-3713-0_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().