메뉴 건너뛰기




Volumn 59, Issue 2, 2008, Pages 95-134

Optimal control of parallel server systems with many servers in heavy traffic

Author keywords

Call centers; Customer abandonment; Halfin Whitt regime; Load balancing; Skill based routing; State space collapse

Indexed keywords

RESOURCE ALLOCATION;

EID: 50249152331     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-008-9078-5     Document Type: Article
Times cited : (52)

References (34)
  • 2
    • 29144497197 scopus 로고    scopus 로고
    • Dynamic routing in large-scale service systems with heterogeneous servers
    • Armony, M.: Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Syst. 51, 287-329 (2005)
    • (2005) Queueing Syst. , vol.51 , pp. 287-329
    • Armony, M.1
  • 3
    • 4544352590 scopus 로고    scopus 로고
    • Contact centers with a call-back option and real-time delay information
    • Armony, M., Maglaras, C.: Contact centers with a call-back option and real-time delay information. Oper. Res. 52, 527-545 (2004)
    • (2004) Oper. Res. , vol.52 , pp. 527-545
    • Armony, M.1    Maglaras, C.2
  • 4
    • 0141510439 scopus 로고    scopus 로고
    • On customer contact centers with a call-back option: Customer decisions, routing rules and system design
    • Armony, M., Maglaras, C.: On customer contact centers with a call-back option: Customer decisions, routing rules and system design. Oper. Res. 52, 271-292 (2004)
    • (2004) Oper. Res. , vol.52 , pp. 271-292
    • Armony, M.1    Maglaras, C.2
  • 5
    • 14544295403 scopus 로고    scopus 로고
    • Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies
    • Ata, B., Kumar, S.: Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15, 331-391 (2005)
    • (2005) Ann. Appl. Probab. , vol.15 , pp. 331-391
    • Ata, B.1    Kumar, S.2
  • 6
    • 14544287797 scopus 로고    scopus 로고
    • A diffusion model of scheduling control in queueing systems with many servers
    • Atar, R.: A diffusion model of scheduling control in queueing systems with many servers. Ann. Appl. Probab. 15, 820-852 (2005)
    • (2005) Ann. Appl. Probab. , vol.15 , pp. 820-852
    • Atar, R.1
  • 7
    • 14544279564 scopus 로고    scopus 로고
    • Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic
    • Atar, R.: Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15, 2606-2650 (2005)
    • (2005) Ann. Appl. Probab. , vol.15 , pp. 2606-2650
    • Atar, R.1
  • 8
    • 11244303067 scopus 로고    scopus 로고
    • Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic
    • Atar, R., Mandelbaum, A., Reiman, M.: Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. 14, 1084-1134 (2004)
    • (2004) Ann. Appl. Probab. , vol.14 , pp. 1084-1134
    • Atar, R.1    Mandelbaum, A.2    Reiman, M.3
  • 9
    • 33846872986 scopus 로고    scopus 로고
    • Queueing systems with many servers: Null controllability in heavy traffic
    • 4
    • Atar, R., Mandelbaum, A., Shaikhet, G.: Queueing systems with many servers: null controllability in heavy traffic. Ann. Appl. Probab. 16(4), 1764-1804 (2006)
    • (2006) Ann. Appl. Probab. , vol.16 , pp. 1764-1804
    • Atar, R.1    Mandelbaum, A.2    Shaikhet, G.3
  • 10
    • 0035413555 scopus 로고    scopus 로고
    • Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
    • Bell, S.L., Williams, R.J.: Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11, 608-649 (2001)
    • (2001) Ann. Appl. Probab. , vol.11 , pp. 608-649
    • Bell, S.L.1    Williams, R.J.2
  • 11
    • 24944531798 scopus 로고    scopus 로고
    • Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy
    • Bell, S.L., Williams, R.J.: Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electron. J. Probab. 10, 1044-1115 (2005)
    • (2005) Electron. J. Probab. , vol.10 , pp. 1044-1115
    • Bell, S.L.1    Williams, R.J.2
  • 13
    • 0032262849 scopus 로고    scopus 로고
    • State space collapse with application to heavy traffic limits for multiclass queueing networks
    • Bramson, M.: State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. 30, 89-148 (1998)
    • (1998) Queueing Syst. , vol.30 , pp. 89-148
    • Bramson, M.1
  • 15
    • 0009859421 scopus 로고    scopus 로고
    • Stability of fluid and stochastic processing networks
    • Dai, J.G.: Stability of Fluid and Stochastic Processing Networks. MaPhySto (1999)
    • (1999) MaPhySto
    • Dai, J.G.1
  • 16
    • 18744413544 scopus 로고    scopus 로고
    • Maximum pressure policies in stochastic processing networks
    • Dai, J.G., Lin, W.: Maximum pressure policies in stochastic processing networks. Oper. Res. 53, 197-218 (2005)
    • (2005) Oper. Res. , vol.53 , pp. 197-218
    • Dai, J.G.1    Lin, W.2
  • 17
    • 50249094735 scopus 로고    scopus 로고
    • Asymptotic optimality of maximum pressure policies in stochastic processing networks
    • to appear
    • Dai, J.G., Lin, W.: Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. (2008, to appear)
    • (2008) Ann. Appl. Probab.
    • Dai, J.G.1    Lin, W.2
  • 20
    • 0345117077 scopus 로고    scopus 로고
    • Telephone call centers: Tutorial, review and research prospects
    • Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: Tutorial, review and research prospects. Manuf. Serv. Oper. Manag. 5, 79-141 (2003)
    • (2003) Manuf. Serv. Oper. Manag. , vol.5 , pp. 79-141
    • Gans, N.1    Koole, G.2    Mandelbaum, A.3
  • 22
    • 50249128875 scopus 로고    scopus 로고
    • Scheduling flexible servers with convex delay costs in many-server service systems
    • to appear
    • Gurvich, I., Whitt, W.: Scheduling flexible servers with convex delay costs in many-server service systems. Manuf. Serv. Oper. Manag. (2008, to appear)
    • (2008) Manuf. Serv. Oper. Manag.
    • Gurvich, I.1    Whitt, W.2
  • 23
    • 41549147211 scopus 로고    scopus 로고
    • Staffing and control of large-scale service systems with multiple customer classes and fully flexible servers
    • Gurvich, I., Armony, M., Mandelbaum, A.: Staffing and control of large-scale service systems with multiple customer classes and fully flexible servers. Manag. Sci. 54, 279-294 (2008)
    • (2008) Manag. Sci. , vol.54 , pp. 279-294
    • Gurvich, I.1    Armony, M.2    Mandelbaum, A.3
  • 24
    • 0019560371 scopus 로고
    • Heavy-traffic limits for queues with many exponential servers
    • Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29, 567-588 (1981)
    • (1981) Oper. Res. , vol.29 , pp. 567-588
    • Halfin, S.1    Whitt, W.2
  • 26
    • 0032147993 scopus 로고    scopus 로고
    • Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
    • Harrison, J.M.: Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8, 822-848 (1998)
    • (1998) Ann. Appl. Probab. , vol.8 , pp. 822-848
    • Harrison, J.M.1
  • 27
    • 0034344279 scopus 로고    scopus 로고
    • Brownian models of open processing networks: Canonical representation of workload
    • Harrison, J.M.: Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10, 75-103 (2000)
    • (2000) Ann. Appl. Probab. , vol.10 , pp. 75-103
    • Harrison, J.M.1
  • 28
    • 0032647070 scopus 로고    scopus 로고
    • Heavy traffic resource pooling in parallel-server systems
    • Harrison, J.M., López, M.J.: Heavy traffic resource pooling in parallel-server systems. Queueing Syst. Theory Appl. 33, 339-368 (1999)
    • (1999) Queueing Syst. Theory Appl. , vol.33 , pp. 339-368
    • Harrison, J.M.1    López, M.J.2
  • 29
    • 19744380935 scopus 로고    scopus 로고
    • Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime
    • Harrison, J.M., Zeevi, A.: Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime. Oper. Res. 52, 243-257 (2004)
    • (2004) Oper. Res. , vol.52 , pp. 243-257
    • Harrison, J.M.1    Zeevi, A.2
  • 30
    • 12344326034 scopus 로고    scopus 로고
    • Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule
    • Mandelbaum, A., Stolyar, A.: Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52, 836-855 (2004)
    • (2004) Oper. Res. , vol.52 , pp. 836-855
    • Mandelbaum, A.1    Stolyar, A.2
  • 31
    • 12344330695 scopus 로고    scopus 로고
    • Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
    • Stolyar, A.: Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14, 1-53 (2004)
    • (2004) Ann. Appl. Probab. , vol.14 , pp. 1-53
    • Stolyar, A.1
  • 32
    • 50249097728 scopus 로고    scopus 로고
    • Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic
    • to appear
    • Tezcan, T., Dai, J.G.: Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. (2008, to appear)
    • (2008) Oper. Res.
    • Tezcan, T.1    Dai, J.G.2
  • 33
    • 0000834346 scopus 로고
    • Dynamic scheduling with convex delay costs: The generalized cμ-rule
    • Van Mieghem, J.: Dynamic scheduling with convex delay costs: the generalized cμ-rule. Ann. Appl. Probab. 5, 809-833 (1995)
    • (1995) Ann. Appl. Probab. , vol.5 , pp. 809-833
    • Van Mieghem, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.