Scheduling flexible servers with convex delay costs in many-server service systems

Manufacturing and Service Operations Management

Volumn 11, Issue 2, 2009, Pages 237-253

  Gurvich, Itay ^a   Whitt, Ward ^b  

^a The Sanford C Bernstein Co Center for Leadership and Ethics   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

Cost minimization in many server queues; Generalized c rule; Heavy traffic limits for queues; Many server queues; Queue and idleness ratio control; Queues; Service systems; Skill based routing

Indexed keywords

COST MINIMIZATION IN MANY-SERVER QUEUES; HEAVY-TRAFFIC LIMITS FOR QUEUES; MANY-SERVER QUEUES; QUEUE-AND-IDLENESS-RATIO CONTROL; QUEUES; SERVICE SYSTEMS; SKILL-BASED ROUTING;

CUSTOMER SATISFACTION; QUEUEING NETWORKS; QUEUEING THEORY; SALES; SERVERS;

COSTS;

EID: 67649979703     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1070.0211     Document Type: Article

References (22)

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