Abstract
This chapter pertains when arrivals from two populations come to a system with one server and infinite capacity. The inter-arrival times are exponential and the services times from each population are arbitrary. An example are the calls for service to a squad car in a one-car patrol beat, where some calls are for minor scrapes and others are major incidents, and the combined service times are not exponential. The performance measures of the system are developed, and 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). 2 Populations, One Server, Arbitrary Service (M/G/1/2). In: Fundamentals of Queuing Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3713-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3713-0_10
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)