메뉴 건너뛰기




Volumn 58, Issue 2, 2010, Pages 316-328

Service-level differentiation in many-server service systems via queue-ratio routing

Author keywords

Limit theorems: asymptotic optimality; Many server heavy traffic limits; Networks: multiple classes; Optimization: design, staffing, routing; Queues; Server pools

Indexed keywords

ASYMPTOTIC OPTIMALITY; HEAVY TRAFFIC LIMIT; LIMIT THEOREM; LIMIT THEOREMS: ASYMPTOTIC OPTIMALITY; MANY-SERVER HEAVY-TRAFFIC LIMITS; MULTIPLE CLASS; NETWORKS: MULTIPLE CLASSES;

EID: 77951201335     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0736     Document Type: Article
Times cited : (87)

References (19)
  • 1
    • 29144497197 scopus 로고    scopus 로고
    • Dynamic routing in large-scale service systems with heterogenous servers
    • Armony, M. 2005. Dynamic routing in large-scale service systems with heterogenous servers. Queueing Systems 51(3-4) 287-329.
    • (2005) Queueing Systems , vol.51 , Issue.3-4 , pp. 287-329
    • Armony, M.1
  • 3
    • 14544279564 scopus 로고    scopus 로고
    • Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic
    • DOI 10.1214/105051605000000601
    • Atar, R. 2005. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15(4) 2606-2650. (Pubitemid 43106166)
    • (2005) Annals of Applied Probability , vol.15 , Issue.4 , pp. 2606-2650
    • Atar, R.1
  • 5
    • 29144487977 scopus 로고    scopus 로고
    • Dynamic routing and admission control in high volume service systems: Asymptotic analysis via multi-scale fluid limits
    • Bassamboo, A., J. M. Harrison, A. Zeevi. 2006a. Dynamic routing and admission control in high volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems 51(3-4) 249-285.
    • (2006) Queueing Systems , vol.51 , Issue.3-4 , pp. 249-285
    • Bassamboo, A.1    Harrison, J.M.2    Zeevi, A.3
  • 6
    • 33744794646 scopus 로고    scopus 로고
    • Design and control of a large call center: Asymptotic analysis of an LP-based method
    • Bassamboo, A., J. M. Harrison, A. Zeevi. 2006b. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3) 419-435.
    • (2006) Oper. Res. , vol.54 , Issue.3 , pp. 419-435
    • Bassamboo, A.1    Harrison, J.M.2    Zeevi, A.3
  • 7
    • 3142743698 scopus 로고    scopus 로고
    • Dimensioning large call centers
    • Borst, S., A. Mandelbaum, M. Reiman. 2004. Dimensioning large call centers. Oper. Res. 52(1) 17-34.
    • (2004) Oper. Res. , vol.52 , Issue.1 , pp. 17-34
    • Borst, S.1    Mandelbaum, A.2    Reiman, M.3
  • 10
    • 67649981768 scopus 로고    scopus 로고
    • Queue-and-idleness-ratio controls in manyserver service systems
    • Gurvich, I., W. Whitt. 2009a. Queue-and-idleness-ratio controls in manyserver service systems. Math. Oper. Res. 34(2) 363-396.
    • (2009) Math. Oper. Res. , vol.34 , Issue.2 , pp. 363-396
    • Gurvich, I.1    Whitt, W.2
  • 11
    • 67649979703 scopus 로고    scopus 로고
    • Scheduling flexible servers with convex delay costs in many-server service systems
    • Gurvich, I., W. Whitt. 2009b. Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2) 237-253.
    • (2009) Manufacturing Service Oper. Management , vol.11 , Issue.2 , pp. 237-253
    • Gurvich, I.1    Whitt, W.2
  • 12
    • 41549147211 scopus 로고    scopus 로고
    • Service-level differentiation in call centers with fully flexible servers
    • Gurvich, I., M. Armony, A. Mandelbaum. 2008. Service-level differentiation in call centers with fully flexible servers. Management Sci. 54(2) 279-294.
    • (2008) Management Sci. , vol.54 , Issue.2 , pp. 279-294
    • Gurvich, I.1    Armony, M.2    Mandelbaum, A.3
  • 14
    • 0019560371 scopus 로고
    • Heavy-traffic limits for queues with many exponential servers
    • Halfin, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3) 567-587.
    • (1981) Oper. Res. , vol.29 , Issue.3 , pp. 567-587
    • Halfin, S.1    Whitt, W.2
  • 15
    • 12344326034 scopus 로고    scopus 로고
    • Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule
    • 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.
    • (2004) Oper. Res. , vol.52 , Issue.6 , pp. 836-855
    • Mandelbaum, A.1    Stolyar, A.2
  • 16
    • 0000834346 scopus 로고
    • Dynamic scheduling with convex delay costs: The generalized cμ rule
    • Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3) 809-833.
    • (1995) Ann. Appl. Probab. , vol.5 , Issue.3 , pp. 809-833
    • Van Mieghem, J.A.1
  • 17
    • 3943052396 scopus 로고    scopus 로고
    • Due date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules
    • Van Mieghem, J. A. 2003. Due date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules. Oper. Res. 51(1) 113-122.
    • (2003) Oper. Res. , vol.51 , Issue.1 , pp. 113-122
    • Van Mieghem, J.A.1
  • 18
    • 28244455337 scopus 로고    scopus 로고
    • A staffing algorithm for call centers with skill-based routing
    • Wallace, R. B., W. Whitt. 2005. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4) 276-294.
    • (2005) Manufacturing Service Oper. Management , vol.7 , Issue.4 , pp. 276-294
    • Wallace, R.B.1    Whitt, W.2
  • 19
    • 30944441649 scopus 로고    scopus 로고
    • A multi-class fluid model for a contact center with skillbased routing
    • Whitt, W. 2006. A multi-class fluid model for a contact center with skillbased routing. Internat. J. Electronics Comm. (AEU) 60(2) 95-102.
    • (2006) Internat. J. Electronics Comm. (AEU) , vol.60 , Issue.2 , pp. 95-102
    • Whitt, W.1


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