Abstract
The application of queueing theory often involves several queueing processes connected to one another as departures from one process become arrivals to another process. For example, if a bank were to be modeled, some customers from the “New Accounts” desk might go next to a teller line or to the safety deposit room. Or if the Panama Canal were to be simulated, each of the three locks would have to be modeled as a queueing process with customers (i.e., ships) flowing from one lock to another or from the entrance of the canal to a lock. Many manufacturing systems and supply chains can be modeled as a complex queueing network in which output from one process flows to other queueing processes, sometimes with probabilistic routing and sometimes with deterministic routing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Curry, G.L., and Feldman, R.M. (2009). Manufacturing Systems Modeling and Analysis, Springer-Verlag, Berlin.
Gross, D., and Harris, C.M. (1998). Fundamentals of Queueing Theory, 3rd ed., John Wile & Sons, New York.
Jackson, J.R. (1957). Networks of Waiting Lines. Operations Research, 5:518–521.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Feldman, R.M., Valdez-Flores, C. (2010). Queueing Networks. In: Applied Probability and Stochastic Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05158-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-05158-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05155-5
Online ISBN: 978-3-642-05158-6
eBook Packages: EngineeringEngineering (R0)