메뉴 건너뛰기




Volumn 60, Issue 4, 2012, Pages 981-995

Hazard rate scaling of the abandonment distribution for the GI/M/nCGI queue in heavy traffic

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DIFFUSION APPROXIMATIONS; HAZARD RATES; HEAVY TRAFFIC LIMIT; HEAVY TRAFFICS; NUMERICAL STUDIES; PERFORMANCE MEASURE; SHOW THROUGH; TELEPHONE CALL CENTERS; TIME DISTRIBUTION;

EID: 84866378700     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1069     Document Type: Article
Times cited : (27)

References (27)
  • 1
    • 0019686316 scopus 로고
    • On queues with impatient customers
    • Kylstra FJ, ed. North-Holland Publishing Company, Amsterdam)
    • Baccelli F, Hebuterne G (1981) On queues with impatient customers Kylstra FJ, ed., Performance 81 (North-Holland Publishing Company, Amsterdam), 159-179.
    • (1981) Performance , vol.81 , pp. 159-179
    • Baccelli, F.1    Hebuterne, G.2
  • 3
    • 0344060057 scopus 로고
    • Multiserver queues with impatient customers
    • Boxma OJ, de Waal PR (1994) Multiserver queues with impatient customers. ITC 14:743-756.
    • (1994) ITC , vol.14 , pp. 743-756
    • Boxma, O.J.1    De Waal, P.R.2
  • 4
    • 0032654940 scopus 로고    scopus 로고
    • On the M4n5=M4n5=s queue with impatient calls
    • Brandt A, Brandt M (1999) On the M4n5=M4n5=s queue with impatient calls. Performance Evaluation 35(1-2):1-18.
    • (1999) Performance Evaluation , vol.35 , Issue.1-2 , pp. 1-18
    • Brandt, A.1    Brandt, M.2
  • 5
    • 0036090082 scopus 로고    scopus 로고
    • Asymptotic results and a Markovian approximation for the M (n)/M(n)/s + GI system
    • DOI 10.1023/A:1015781818360
    • Brandt A, Brandt M (2000) Asymptotic results and a Markovian approximation for the M4n5=M4n5=s CGI system. Queueing Systems: Theory Appl. 41(1-2):73-94. (Pubitemid 37134384)
    • (2002) Queueing Systems , vol.41 , Issue.1-2 , pp. 73-94
    • Brandt, A.1    Brandt, M.2
  • 6
    • 77953086430 scopus 로고    scopus 로고
    • Customer abandonment in many-server queues
    • Dai JG, He S (2010) Customer abandonment in many-server queues. Math. Oper. Res. 35(2):347-362.
    • (2010) Math. Oper. Res , vol.35 , Issue.2 , pp. 347-362
    • Dai, J.G.1    He, S.2
  • 7
    • 77957706923 scopus 로고    scopus 로고
    • Many-server diffusion limits for G=Ph=nC GI queues
    • Dai JG, He S, Tezcan T (2010) Many-server diffusion limits for G=Ph=nC GI queues. Ann. Appl. Probability 20(5):1854-1890.
    • (2010) Ann. Appl. Probability , vol.20 , Issue.5 , pp. 1854-1890
    • Dai, J.G.1    He, S.2    Tezcan, T.3
  • 11
    • 0036622829 scopus 로고    scopus 로고
    • Designing a call center with impatient customers. Manufacturing Service Oper
    • Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208-227.
    • (2002) Management , vol.4 , Issue.3 , pp. 208-227
    • Garnett, O.1    Mandelbaum, A.2    Reiman, M.3
  • 12
    • 0019560371 scopus 로고
    • Heavy-traffic limits for queues with many exponential servers
    • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567-588. (Pubitemid 12437583)
    • (1981) Operations Research , vol.29 , Issue.3 , pp. 567-588
    • Halfin, S.1    Whitt, W.2
  • 14
    • 77957695286 scopus 로고    scopus 로고
    • Fluid limits of many-server queues with reneging
    • Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Probability 20(6):2204-2260.
    • (2010) Ann. Appl. Probability , vol.20 , Issue.6 , pp. 2204-2260
    • Kang, W.1    Ramanan, K.2
  • 15
    • 84858699374 scopus 로고    scopus 로고
    • Queues with many servers and impatient customers
    • Mandelbaum A, Momčilovic P (2012) Queues with many servers and impatient customers. Math. Oper. Res. 37(1):41-65
    • (2012) Math. Oper. Res , vol.37 , Issue.1 , pp. 41-65
    • Mandelbaum, A.1    Momčilovic, P.2
  • 16
    • 65349176278 scopus 로고    scopus 로고
    • Staffing many-server queues with impatient customers: Constraint satisfaction in call centers
    • Mandelbaum A, Zeltyn S (2009) Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. 57(5):1189-1205.
    • (2009) Oper. Res , vol.57 , Issue.5 , pp. 1189-1205
    • Mandelbaum, A.1    Zeltyn, S.2
  • 17
    • 0001788595 scopus 로고
    • Methods of judging the annoyance caused by congestion
    • Palm C (1953) Methods of judging the annoyance caused by congestion. Tele 2:189-208.
    • (1953) Tele , vol.2 , pp. 189-208
    • Palm, C.1
  • 18
    • 0039813689 scopus 로고
    • Research on telephone traffic carried by full availability groups
    • Palm C (1957) Research on telephone traffic carried by full availability groups. Tele 1:1-107.
    • (1957) Tele , vol.1 , pp. 1-107
    • Palm, C.1
  • 19
    • 52949126577 scopus 로고    scopus 로고
    • Martingale proofs of manyserver heavy-traffic limits for Markovian queues
    • Pang G, Talreja R, Whitt W (2007) Martingale proofs of manyserver heavy-traffic limits for Markovian queues. Probability Surveys 4:193-267.
    • (2007) Probability Surveys , vol.4 , pp. 193-267
    • Pang, G.1    Talreja, R.2    Whitt, W.3
  • 20
    • 61349192650 scopus 로고    scopus 로고
    • Approximating the GI=GI=1CGI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic
    • Reed JE, Ward AR (2008) Approximating the GI=GI=1CGI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33(3):606-644.
    • (2008) Math. Oper. Res , vol.33 , Issue.3 , pp. 606-644
    • Reed, J.E.1    Ward, A.R.2
  • 21
    • 0009685472 scopus 로고
    • The heavy-traffic diffusion approximation for sojourn times in Jackson networks
    • Disney RL, Ott TJ, eds (Birkhäuser, Boston)
    • Reiman MI (1982) The heavy-traffic diffusion approximation for sojourn times in Jackson networks. Disney RL, Ott TJ, eds. Applied Probability - Computer Sciences, the Interface II (Birkhäuser, Boston), 409-422.
    • (1982) Applied Probability - Computer Sciences, the Interface II , pp. 409-422
    • Reiman, M.I.1
  • 22
    • 0037236333 scopus 로고    scopus 로고
    • A diffusion approximation for a Markovian queue with reneging
    • Ward AR, Glynn PW (2003) A diffusion approximation for a Markovian queue with reneging. Queueing Systems: Theory Appl. 43(1-2): 103-128.
    • (2003) Queueing Systems: Theory Appl , vol.43 , Issue.1-2 , pp. 103-128
    • Ward, A.R.1    Glynn, P.W.2
  • 23
    • 24944567414 scopus 로고    scopus 로고
    • A diffusion approximation for a GI/GI/1 queue with balking or reneging
    • DOI 10.1007/s11134-005-3282-3
    • Ward AR, Glynn PW (2005) A diffusion approximation for a GI=GI=1 queue with balking or reneging. Queueing Systems: Theory Appl. 50(4):371-400. (Pubitemid 41312620)
    • (2005) Queueing Systems , vol.50 , Issue.4 , pp. 371-400
    • Ward, A.R.1    Glynn, P.W.2
  • 25
    • 14844304484 scopus 로고    scopus 로고
    • Engineering solution of a basic call-center model
    • DOI 10.1287/mnsc.1040.0302
    • Whitt W (2005a) Engineering solution of a basic call center model. Management Sci. 51(2):221-235. (Pubitemid 40360164)
    • (2005) Management Science , vol.51 , Issue.2 , pp. 221-235
    • Whitt, W.1
  • 26
    • 84858522672 scopus 로고    scopus 로고
    • Heavy-traffic limits for the G=H2=n=m queue
    • Whitt W (2005b) Heavy-traffic limits for the G=H2=n=m queue. Math. Oper. Res. 30(1):1-27.
    • (2005) Math. Oper. Res , vol.30 , Issue.1 , pp. 1-27
    • Whitt, W.1
  • 27
    • 29144434014 scopus 로고    scopus 로고
    • Call centers with impatient customers: Many-server asymptotics of the M/M/n + G queue
    • DOI 10.1007/s11134-005-3699-8, Stochastic Networks
    • Zeltyn S, Mandelbaum A (2005) Call centers with impatient customers: Many-server asymptotics of the M=M=nCG queue. Queueing Systems: Theory Appl. 51(3-4):361-402. (Pubitemid 41813337)
    • (2005) Queueing Systems , vol.51 , Issue.SPEC. ISS. , pp. 361-402
    • Zeltyn, S.1    Mandelbaum, A.2


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