Abstract
This chapter explores a multi-server, finite capacity system with exponential inter-arrival and service times. An example is a beauty shop with two hair stylists and with room for only five customers in the shop. The difference, equilibrium and reduced equations are listed. The probability on n units, and the performance measures are developed. Examples are presented to guide the reader.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author 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). Multi Servers, Finite Queue (M/M/k/N). In: Fundamentals of Queuing Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3713-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3713-0_7
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)