Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems

References

• Armony M. Dynamic routing in large-scale service systems with heterogenous servers. Queueing Systems (2005) 51(3–4):287–329Crossref, Google Scholar
• Atar R. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. (2005) 15(4):2606–2650Crossref, Google Scholar
• Atar R., Mandelbaum A., Reiman M. Scheduling a multi-class queue with many iid servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. (2004) 14(3):1084–1134Crossref, Google Scholar
• Bramson M. State space collapse with applications to heavy-traffic limits for multiclass queueing networks. Queueing Systems (1998) 30(1–2):89–148Crossref, Google Scholar
• Dai J. G., Tezcan T. Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. (2008a) . ForthcomingGoogle Scholar
• Dai J. G., Tezcan T. Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems. (2008b) . ForthcomingGoogle Scholar
• Dai J. G., Tezcan T. State space collapse in many server diffusion limits of parallel server systems. Math. Oper. Res. (2009) . ForthcomingGoogle Scholar
• Gurvich I., Whitt W. Service-level differentiation in many-server service systems: A solution based on fixed-queue-ratio routing. (2007a) . Working paper, Columbia University, New YorkGoogle Scholar
• Gurvich I., Whitt W. Queue-and-idleness-ratio controls in many-server service systems. (2007b) . Working paper, Columbia University, New YorkGoogle Scholar
• Gurvich I., Armony M., Mandelbaum A. Service-level differentiation in call centers with fully flexible servers. Management Sci. (2008) 54(2):279–294Link, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–587Link, Google Scholar
• Harrison J. M., Fleming W., Lions P. L. Brownian models of queueing networks with heterogeneous customer populations. Stochastic Differential Systems, Stochastic Control Theory and Applications (1988) (Springer, New York) 147–186Crossref, 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(3):822–848Crossref, Google Scholar
• Harrison J. M., Zeevi A. Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime. Oper. Res. (2004) 52(2):243–257Link, Google Scholar
• Ibaraki T., Katoh N.Resource Allocation Problems: Algorithmic Approaches (1988) (MIT Press, Cambridge, MA) No. 4, Foundations of Computing SeriesGoogle Scholar
• Mandelbaum A., Stolyar A. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. (2004) 52(6):836–855Link, Google Scholar
• Pang G., Talreja R., Whitt W. Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probability Surveys (2007) 4:193–267Crossref, Google Scholar
• Patriksson M. A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. (2008) 185(1):1–46Crossref, Google Scholar
• Stidham S. A survey of Markov decision models for control of networks of queues. Queueing Systems (1993) 13(1–3):291–314Crossref, Google Scholar
• Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. (1995) 5(3):809–833Crossref, Google Scholar
• Whitt W.Stochastic-Process Limits: An Introduction to Stochastic Process Limits and Their Application to Queues (2002) (Springer-Verlag, New York) Google Scholar
• Zipkin P. H. Simple ranking methods for the allocation of one resource. Management Sci. (1980) 26:34–43Link, Google Scholar