Skip to main content

Queueing Networks

  • Chapter
  • First Online:
Applied Probability and Stochastic Processes

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Curry, G.L., and Feldman, R.M. (2009). Manufacturing Systems Modeling and Analysis, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  2. Gross, D., and Harris, C.M. (1998). Fundamentals of Queueing Theory, 3rd ed., John Wile & Sons, New York.

    MATH  Google Scholar 

  3. Jackson, J.R. (1957). Networks of Waiting Lines. Operations Research, 5:518–521.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard M. Feldman .

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics