Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule

References

• Andrews M., Kumaran K., Ramanan K., Stolyar A. L., Vijayakumar R., Whiting P. Scheduling in a queueing system with asynchronously varying service rates. Probab. Engrg. Inform. Sci. (2004) 18:191–217Crossref, Google Scholar
• Armony M., Bambos N. Queueing networks with interacting service resources. Proc. 37th Annual Allerton Conference on Communication, Control and Computing (1999) (Monticello, IL)42–51Google Scholar
• Bell S. L., Williams R. J. Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Ann. Probab. (2001) 11:608–649Crossref, Google Scholar
• Bramson M. State space collapse with applications to heavy traffic limits for multiclass queueing networks. Queueing Systems (1998) 30:89–148Crossref, Google Scholar
• Chen H., Mandelbaum A. Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Ann. Probab. (1991a) 19:1463–1519Crossref, Google Scholar
• Chen H., Mandelbaum A., Davis M. H. A., Elliott R. J. Leontief systems, RBV's and RBM's. Applied Stochastic Analysis (1991b) (Gordon and Breach Science, Publishers, New York) 1–43Google Scholar
• Cox D. R., Smith W. L.Queues (1961) (Methuen, London, U.K., and Wiley, New York) Google Scholar
• Dai J. G., Prabhakar B. The throughput of data switches with and without speedup. Proc. INFOCOM'2000 (2000) 556–564Google Scholar
• Ethier S. N., Kurtz T. G.Markov Process: Characterization and Convergence (1986) (John Wiley and Sons, New York) Crossref, Google Scholar
• Glazebrook K. D., Nino-Mora J. Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance. Oper. Res. (2001) 49:609–623Link, Google 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–848Crossref, Google Scholar
• Harrison J. M., Lopez M. J. Heavy traffic resource pooling in parallel-server systems. Queueing Systems (1999) 33:339–368Crossref, Google 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–771Crossref, Google Scholar
• Klimov G. P. Time sharing systems I. Theory Probab. Appl. (1974) 19:532–551Crossref, Google Scholar
• Klimov G. P. Time sharing systems II. Theory Probab. Appl. (1978) 23:314–321Crossref, Google Scholar
• McKeown N., Anantharam V., Walrand J. Achieving 100% throughput in an input-queued switch. Proc. INFOCOM'96 (1996) 296–302Crossref, Google Scholar
• Reiman M. I. Some diffusion approximations with state space collapse. Proc. Internat. Seminar Modeling Performance Evaluation Methodology (1984) (Springer, New York) 209–240Lecture Notes in Control and Information SciencesCrossref, Google Scholar
• Reiman M. I. A multiclass feedback queue in heavy traffic. Adv. Appl. Probab. (1988) 20:179–207Crossref, Google Scholar
• Stolyar A. L. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. (2004) 14:1–53Crossref, Google Scholar
• Tassiulas L., Ephremides A. Stability properties of constrainted queueing systems and scheduling policies for maximum throughput in multishop radio network. IEEE Trans. Automatic Control (1992) 37:1936–1948Crossref, Google Scholar
• Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. (1995) 5:809–833Crossref, Google Scholar
• Whitt W. Improving service by informing customers about anticipated delays. Management Sci. (1999) 45:192–207Link, Google Scholar
• Williams R. J. An invariance principle for semimartingale reflecting Brownian motions in an orthant. Queueing Systems (1998a) 30:5–25Crossref, Google Scholar
• Williams R. J. Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems (1998b) 30:27–88Crossref, Google Scholar
• Williams R. J. On dynamic scheduling of a parallel server system with complete resource pooling. Fields Institute Communications (2000) 28:49–71Google Scholar
• Zohar E., Mandelbaum A., Shimkin N. Adaptive behavior of impatient customers in tele-queues: Theory and empirical support. Management Sci. (2002) 48:566–583Link, Google Scholar