Skip to main content

Optimal Operation of Queues

  • Conference paper
Mathematical Methods in Queueing Theory

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 98))

Abstract

The early growth of queueing theory was motivated by the design of telephone and other service systems. As the literature expanded, much of its growth consisted of mathematical theory suggested by the literature itself rather than by congested service systems. This self-sustaining theoretical growth has been coupled recently with a renewed pragmatic motivation. The result has been an increase in the volume of prescriptive research in queueing theory. Most of these recent contributions begin by embellishing a standard queueing model with a cost structure. Although they go on to address the question of optimal design or of optimal operation, one might imagine that including a cost structure is merely hanging bells and jangles on a standard model. Although that conjecture may be valid, the analysis of normative queueing models often differs fundamentally from the derivation of properties of descriptive models and it provides new insights into how congestion should be managed.

Partially supported by National Science Foundation Grant GK-38121

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Balachandran, K. (1973) Control policies for a single-server system. Mgt. Sci. 19, 1013–1018.

    Article  MATH  Google Scholar 

  2. Beja, A. (1972) The optimality of connected policies for Markovian systems with two types of service. Mqt. Sci. 18, 683–686.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bell, C. (1971) Characterization and computation of optimal policies for operating an M/G/1 queuing system with removable server. Opns. Res. 19, 208–218.

    Article  MATH  Google Scholar 

  4. Blackburn, J. (1972) Optimal control of a single-server queue with balking and reneging. Mqt. Sci. 19, 297–313.

    MATH  MathSciNet  Google Scholar 

  5. Brosh, I. (1970) The policy space structure of Markovian systems with two types of service. Mqt. Sci. 16, 607–621.

    MATH  MathSciNet  Google Scholar 

  6. Crabill, T. (1972) Optimal control of a service facility with variable exponential service times and constant arrival rate. Mqt. Sci. 18 560–566.

    MATH  MathSciNet  Google Scholar 

  7. Crabill, T., Gross, D., and Magazine, M. (1973) A survey of research on optimal design and control of queues. Serial T-280, Inst. for Mgt. Sci. and Eng., School of Eng., School of Eng. and Appl. Sci., George Washington Univ.

    Google Scholar 

  8. Deb, R. (1971) Optimal control of balk queues. Ph.D. Dissertation, Systems and Information Science Department, Syracuse University, New York.

    Google Scholar 

  9. Deb, R., and Serfozo, R. (1972) Optimal control of batch-service queues. Dept. of Industrial Eng. and Oper. Res., Syracuse Univ.

    Google Scholar 

  10. Derman, C. (1962) On sequential decisions and Markov chains. Mqt. Sci. 9, 16–24.

    MATH  MathSciNet  Google Scholar 

  11. Emmons, H. (1972) The optimal admission policy to a multi-server queue with finite horizon. J. Appl. Prob. 9, 103–116.

    Article  MathSciNet  Google Scholar 

  12. Esogbue, A. (1969) Dynamic programming and optimal control of variable multichannel stochastic service systems with applications. Math. Biosciences 5, 133–142.

    Article  Google Scholar 

  13. Feller, W. (1957) An Introduction to Probability Theory and its Applications. (second edition) Wiley, New York.

    Google Scholar 

  14. Gebhard, R. (1967) A queuing process with bilevel hysteretic service-rate control. Naval Res. Log. Quart. 14, 55–67.

    Article  MATH  Google Scholar 

  15. Heyman, D. (1968) Optimal operating policies for M/G/1 queuing systems. Opns. Res. 16, 362–382.

    Article  MATH  Google Scholar 

  16. Heyman, D., and Marshall, K. (1968) Bounds on the optimal operating policy for a class of single-server queues. Opns. Res. 16, 1138–1146.

    Article  MATH  Google Scholar 

  17. Iglehart, D. (1963) Dynamic programming and stationary analysis of inventory problems. Multistate Inventory Models and Techniques ed. by Scarf, H., Gilford, D., and Shelly, M., Stanford University Press, Stanford, California.

    Google Scholar 

  18. Iglehart, D. (1963) Optimality of (s,S) policies in the infinite-horizon inventory problem. Mqt. Sci. 9, 259–267.

    Google Scholar 

  19. Jaiswal, N., and Simha, P. (1972) Optimal operating policies for the finite-source queuing process. Opns. Res. 20, 698–707.

    Article  MATH  Google Scholar 

  20. Lippman, S. (1973) Semi-Markov decision processes with unbounded rewards. Mqt. Sci. 19, 717–731.

    MATH  MathSciNet  Google Scholar 

  21. Magazine, M. (1971) Optimal control of multi-channel service systems. Nay. Res. Log. Quart. 18, 177–183.

    Article  MATH  MathSciNet  Google Scholar 

  22. McGill, J. (1969) Optimal control of a queuing system with variable number of exponential servers. Tech. Rpt. No. 123, Dept. of Oper. Res. and Dept. of Stat., Stanford Univ.

    Google Scholar 

  23. Miller, B. (1969) A queuing reward system with several customer classes. Mqt. Sci. 16, 234–245.

    Google Scholar 

  24. Mitchell, W. (1973) Optimal service-rate selection in piecewiselinear Markovian service systems. J. SIAM 24, 19–35.

    MATH  Google Scholar 

  25. Moder, J., and Phillips, C. Jr. (1962) Queuing with fixed and variable channels. Opns. Res. 10, 218–231.

    Article  MATH  MathSciNet  Google Scholar 

  26. Prabhu, N., and Stidham, S. (1973) Optimal control of queueing systems. Mathematical Methods in Queueing Theory (this volume).

    Google Scholar 

  27. Sabeti, H. (1970) Optimal decision in queueing. ORC 70–12, Operations Research Center, Univ. of California, Berkeley.

    Google Scholar 

  28. Sobel, M. (1969) Optimal average-cost policy for a queue with start-up and shut-down costs. Opns. Res. 17, 145–162.

    Article  MATH  MathSciNet  Google Scholar 

  29. Sobel, M. (1970) Making short-run changes in production when the employment level is fixed. Opns. Res. 18, 35–51.

    Article  MathSciNet  Google Scholar 

  30. Sobel, M. (1971) Production smoothing with stochastic demand II: infinite-horizon case. Mqt. Sci. 17, 724–735.

    MATH  MathSciNet  Google Scholar 

  31. Sobel, M. (1973) Queuing processes at competing service facilities. Mqt. Sci. 19, 985–1000.

    Google Scholar 

  32. Sobel, M. (1973) Higher tolls on faster roads. Unpublished manuscript.

    Google Scholar 

  33. Stidham, S. Jr. (1970) On the optimality of single-server queuing systems. Opns. Res. 18, 708–732.

    Article  MATH  MathSciNet  Google Scholar 

  34. Stidham, S. Jr. (1972) L = XW: a discounted analogue and a new proof. Opns. Res. 20, 1115–1126.

    Article  MATH  MathSciNet  Google Scholar 

  35. Thatcher, R. (1968) Optimal single-channel service policies for stochastic arrivals. ORC 68–16, Operations Research Center Univ. of California, Berkeley.

    Google Scholar 

  36. Topkis, D., and Veinott, A. (1968) Personal communication.

    Google Scholar 

  37. Torbett, A. (1973) Models for the control of Markovian closed queueing systems with adjustable service rates. Tech. Rpt. No. 39 (NR-047–061), Dept. of Operations Research, Stanford Univ.

    Google Scholar 

  38. Yadin, M., and Naor, P. (1963) Queuing systems with removable service station. Opnal. Res. Quart. 17, 393–405.

    Article  Google Scholar 

  39. Yadin, M., and Naor, P. (1967) Queuing systems with variable service capacities. Naval Res. Log. Quart. 14, 43–53.

    Article  MATH  Google Scholar 

  40. Yadin, M., and Zacks, S. (1969) Analytic characterization of the optimal control policy of a queuing system. Tech. Rpt. No. 176, Dept. of Mathematics and Statistics, Univ. of New Mexico.

    Google Scholar 

  41. Zacks, S., and Yadin, M. (1970) Analytic characterization of the optimal control of a queueing system. J. Appl. Prob. 7, 617–633.

    Article  MATH  MathSciNet  Google Scholar 

  42. Crabill, T. (1969) Optimal control of a queue with variable service rates. Tech.Rpt. No. 75, Dept. of Opns. Res.,Cornell Univ.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Sobel, M.J. (1974). Optimal Operation of Queues. In: Clarke, A.B. (eds) Mathematical Methods in Queueing Theory. Lecture Notes in Economics and Mathematical Systems, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80838-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80838-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06763-4

  • Online ISBN: 978-3-642-80838-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics