Skip to main content

Final Coda

  • Chapter
  • First Online:
Introduction to Queueing Networks

Overview

In this last chapter, we summarize the volume’s contents, provide a review of the software tools available that were presented in the various chapters, and provide some open questions for future research and development.

  • Chapter 1: Introduction G(V, E)

  • Chapter 2: Problem Overview \(\varOmega {\bigl (G(V,E)\bigr )}\)

  • Chapter 3: Mathematical Models and Properties of Queues G(V )

  • Chapter 4: Transportation and Loss Queues G(E)

  • Chapter 5: Open Queueing Network Algorithms \(f{\bigl (G(V,E)\bigr )}\)

  • Chapter 6: Closed Queueing Network Algorithms \(f{\bigl (G(V,E,N)\bigr )}\)

  • Chapter 7: Optimal Resource Allocation Problems G(V )

  • Chapter 8: Optimal Routing Problems G(E )

  • Chapter 9: Optimal Topology Problems G(V, E)

I have answered three questions, and that is enough,

Said his father, Don’t give yourself airs!

Do you think I can listen all day to such stuff?

Be off, or I’ll kick you downstairs!—Lewis Carrol

Better is the end of a thing than the beginning thereof. —The Bible, Ecclesiastes 7:8

It ain’t over till it’s over. —Yogi Berra

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.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

References

  1. Fu, Q. and W. Whitt, 2013. “Models to Study the Pace of Play in Golf.” submitted to Operations Research.

    Google Scholar 

  2. Smith, J. MacGregor, 2017. “Simultaneous Buffer and Service Rate Allocation in Open Finite Queueing Networks.” accepted in IISE Transactions.

    Google Scholar 

  3. Smith, J. MacGregor, 2017. “Joint Optimization of Buffers and Network Population for Closed Finite Queueing Systems,” International Journal of Production Research. 54 (17), 5111-5135.

    Google Scholar 

  4. Tiger, A. and D. Salzer, 2004. “Daily Play at a Golf Course: Using Spreadsheet Simulation to Identify System Constraints.” INFORMS Transactions on Education. 4 (2), 28-35.

    Google Scholar 

  5. Zhang, H., Q.X. Chen, J. MacGregor Smith, N. Mao, L. Ai, and Z. Li, 2016. “Performance Evaluation of Open Finite Queueing Networks with Bernoulli Feedback”. Accepted in the Int. Journal of Production Research.

    Google Scholar 

  6. Zhang, H., S. Xi, Q.X. Chen, J. MacGregor Smith, X. LI, and N. Mao, 2017. “Performance Analysis of an Integrated Production and Material Handling Serial System with State-dependent Batch Transfer.” in review.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Smith, J.M. (2018). Final Coda. In: Introduction to Queueing Networks. Springer Series in Operations Research and Financial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-78822-7_10

Download citation

Publish with us

Policies and ethics