Skip to main content

Optimal Routing of Customers to Parallel Service Groups

  • Conference paper
  • 170 Accesses

Part of the book series: Operations Research Proceedings ((ORP,volume 1990))

Summary

This paper deals with a queueing system with two service groups each having its own queue. Customers arrive according to a Poission process and arriving customers must be routed irrevocably to one of the two queues. Using Markov decision theory, we study the question of how to rout newly arriving customers. The paper discusses also the performance of several heuristic routing rules including the shortest expected delay rule.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ephremides, P. Varaiya, and J. Walrand (1980), A simple dynamic routing problem, IEEE Trans. Autom. Contr., 25, 690–693.

    Article  Google Scholar 

  2. D.J. Houck (1987), Comparison of policies for routing customers to parallel queueing systems, Oper. Res., 35, 306–310.

    Article  Google Scholar 

  3. K.R. Krishnan (1987), Joining the right queue: a Markov decision-rule, Proceedings of the 26th Conf. on Decision and Control, 1863–1868.

    Google Scholar 

  4. S. Shenker and A. Weinrib (1989), The optimal control of heterogeneous queueing systems: a paradigm for load-sharing and routing, IEEE Trans. Comp., 38, 1724–1735.

    Article  Google Scholar 

  5. H.C. Tijms (1986), Stochastic Modelling and Analysis, Wiley, New York.

    Google Scholar 

  6. R. Weber (1978), On the optimal assignment of customers to parallel servers, J. Appl. Prob., 15, 406–413.

    Article  Google Scholar 

  7. W. Whitt (1986), Deciding which queue to join: some counterexamples, Oper. Res., 34, 55–62.

    Article  Google Scholar 

  8. W. Winston (1977), Optimality of the shortest line discipline, J. Appl. Prob., 14, 181–189.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Nobel, R., Tijms, H. (1992). Optimal Routing of Customers to Parallel Service Groups. In: Bühler, W., Feichtinger, G., Hartl, R.F., Radermacher, F.J., Stähly, P. (eds) Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung. Operations Research Proceedings, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77254-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77254-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55081-5

  • Online ISBN: 978-3-642-77254-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics