Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime

Published Online:https://doi.org/10.1287/opre.1030.0084

References

  • Atar R., Mandelbaum A., Reiman M. I. A Brownian control problem for a simple queueing system in the Halfin-Whitt regime. (2001) . Technical report #1297, Department of Electrical Engineering, Technion, IsraelGoogle Scholar
  • Atar R., Mandelbaum A., Reiman M. I. Scheduling a multiclass queue with many exponential servers:. (2002) . Asymptotic optimality in heavy-traffic. PreprintGoogle Scholar
  • Becker E. B., Carey G. C., Oden J. T.Finite Elements: An Introduction (1981) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Bensoussan A. Studies in Mathematics and Its Applications. Stochastic Control by Functional Analysis Methods (1982) (North-Holland, Amsterdam, The Netherlands) Google Scholar
  • Bertsekas D. P.Dynamic Programming and Optimal Control (1995) (Athena Scientific, Belmont, MA) Google Scholar
  • Browne S., Whitt W., Dshalalow J. Piecewise-linear diffusion processes. Advances in Queueing (1995) (CRC Press, Boca Raton, FL) 463–480Google Scholar
  • Das A., Srikant R. Diffusion approximations for a single node accessed by congestion controlled sources. IEEE Trans. Automatic Control (2000) 45:1783–1799CrossrefGoogle Scholar
  • Fleming P., Simon B. Heavy traffic approximations for a system of infinite servers with load balancing. Probab. Engrg. Inform. Sci. (1999) 13:251–273CrossrefGoogle Scholar
  • Fleming W. H., Soner H. M. Applications of Mathematics. Controlled Markov Processes and Viscosity Solutions (1993) (Springer-Verlag, New York, Berlin) Google Scholar
  • Fleming P., Stolyar A., Simon B. Heavy traffic limit for a mobile phone system loss model. Proc. Nashville ACM Telecomm. Conf. (1995) Nashville, TNGoogle Scholar
  • Garnett O., Mandelbaum A., Reiman M. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4:208–227LinkGoogle Scholar
  • Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29:567–588LinkGoogle Scholar
  • Harrison J. M. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab (1998) 8:822–848CrossrefGoogle Scholar
  • Harrison J. M., López M. J. Heavy traffic resource pooling in parallel-server systems. QUESTA (1999) 33:339–368Google Scholar
  • Harrison J. M., Van Mieghem J. A. Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab (1997) 7:747–771CrossrefGoogle Scholar
  • Karatzas I., Shreve S. E.Brownian Motion and Stochastic Calculus (1991) (Springer, New York) Google Scholar
  • Kelly F. P., Laws C. N. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems Theory Appl. (1993) 13:47–86CrossrefGoogle Scholar
  • Kumar S., Muthukumar M. A numerical method for solving singular Brownian control problems. Oper. Res. (2004) . ForthcomingLinkGoogle Scholar
  • Krylov N. V.Controlled Diffusion Processes (1980) (Springer-Verlag, New York) . Applications of Mathematics no. 14CrossrefGoogle Scholar
  • Kushner H. J. Optimal discounted stochastic control for diffusion processes. SIAM J. Control Optim. (1967) 5:520–531CrossrefGoogle Scholar
  • Kushner H. J., Dupuis P.Numerical Methods for Stochastic Control Problems in Continuous Time (1992) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Ladyzhenskaya O. A., Uraltseva N. N.Linear and Quasilinear Elliptic Equations (1968) (Academic Press, New York) Google Scholar
  • Puhalskii A., Reiman M. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2000) 32:564–595CrossrefGoogle Scholar
  • Rudin W.Real and Complex Analysis (1987) (McGraw-Hill, New York) Google Scholar
  • Sennott L. I.Stochastic Dynamic Programming and the Control of Queueing Systems (1999) (Wiley, New York) Google Scholar
  • Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab (1995) 5:809–833CrossrefGoogle Scholar
  • Veretennikov A. Y. Strong solutions and explicit formulas for solutions of stochastic integral equations. Mat. Sbornik (1980) 111(153):434–452Google Scholar
  • Whitt W. Understanding the efficiency of multi-server service systems. Management Sci. (1992) 38:708–723LinkGoogle Scholar
  • Williams R. J., McDonald D. R., Turner S. R. On dynamic scheduling of a parallel server system with complete resource pooling. Analysis of Communication Networks: Call Centers, Traffic and Performance (2000) (American Mathematical Society, Providence, RI) Fields Institute Communication SeriesCrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.