Abstract
This chapter explores a system with a limited number of units in the input population, like M machines in a shop that occasionally require service from one repairman. The inter-arrival time per unit and the service times are exponential. This could be a firm with five copy machines and one repairman. The probability on the number of units in the system is derived, and the performance measures of the system are developed. Examples are presented.
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). M Machines, One Repairman (M/M/1/M). In: Fundamentals of Queuing Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3713-0_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3713-0_11
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)