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

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

Chapter Chapter 19 in Fundamentals of Queuing Systems, 2012, pp 129-138 from Springer

Abstract: 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.

Keywords: Service Time; Service Level; Expected Number; Loss Probability; Utilization Ratio (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_19

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

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

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 ().