Abstract
This chapter applies to a one-server, no queue system with exponential inter-arrival and service times. Could be a rental store with one electric saw available to rent. The saw is the service facility and the rental time becomes the service time. When the saw is out, future customers do not wait and go elsewhere. The difference, equilibrium and reduced equations are listed. The probability of n units in the system, and the performance measures 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). One Server, No Queue (M/M/1/1). In: Fundamentals of Queuing Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3713-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3713-0_5
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)