One Server, Finite Queue (M/M/1/N)

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

Chapter Chapter 4 in Fundamentals of Queuing Systems, 2012, pp 27-33 from Springer

Abstract: Abstract This chapter explores the one-server, finite capacity system with exponential inter-arrival and service times. Could be, a one-man barbershop with three seats for the waiting customers. The difference, equilibrium and reduced equations are listed, and the probability on the number of units in the system are developed, along with the performance measures. Examples are presented.

Keywords: Finite Queue; Finite Capacity System; Average Service Time; Expected Number; Line Telephone Service (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_4

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

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

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