메뉴 건너뛰기




Volumn 22, Issue 3, 2006, Pages 361-382

Tri-layered QBD processes with boundary assistance for service resources

Author keywords

Boundary assistance; Call centers; QBDs; Spatial queues

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; QUEUEING THEORY; RESOURCE ALLOCATION; SERVERS;

EID: 33747198778     PISSN: 15326349     EISSN: 15324214     Source Type: Journal    
DOI: 10.1080/15326340600820315     Document Type: Article
Times cited : (8)

References (14)
  • 1
    • 0032000009 scopus 로고    scopus 로고
    • Matrix geometric solution of discrete time MAP/PH/1 priority queue
    • Alfa, A.S. Matrix geometric solution of discrete time MAP/PH/1 priority queue. Naval Research Logistics 1998, 45, 23-50.
    • (1998) Naval Research Logistics , vol.45 , pp. 23-50
    • Alfa, A.S.1
  • 2
    • 0141828937 scopus 로고    scopus 로고
    • Analysis of MAP/PH/1 multiclass general preemptive priority queue
    • Alfa, A.S.; Liu, B.; HE, Q. Analysis of MAP/PH/1 multiclass general preemptive priority queue. Naval Research Logistics 2003, 50, 662-682.
    • (2003) Naval Research Logistics , vol.50 , pp. 662-682
    • Alfa, A.S.1    Liu, B.2    He, Q.3
  • 3
    • 0004181590 scopus 로고    scopus 로고
    • Matrix analytical methods
    • Grassmann, W.K., Eds.; Kluwer Academic Publishers
    • Grassmann, W.K.; Stanford, D.A. Matrix analytical methods. In Computational Probability, Grassmann, W.K., Eds.; Kluwer Academic Publishers, 2000; pp. 153-203.
    • (2000) Computational Probability , pp. 153-203
    • Grassmann, W.K.1    Stanford, D.A.2
  • 4
    • 0040539256 scopus 로고
    • Computation of steady-state probabilities for infinate-state Markov chains with repeating rows
    • Grassmann, W.K.; Heyman, D. Computation of steady-state probabilities for infinate-state Markov chains with repeating rows. ORSA Journal on Computing 1993, 5, 282-303.
    • (1993) ORSA Journal on Computing , vol.5 , pp. 282-303
    • Grassmann, W.K.1    Heyman, D.2
  • 10
    • 0019611975 scopus 로고
    • Computation of steady state probabilities for M/M/1 priority queues
    • Miller, D.R. Computation of steady state probabilities for M/M/1 priority queues. Operations Research 1981, 29, 945-958.
    • (1981) Operations Research , vol.29 , pp. 945-958
    • Miller, D.R.1
  • 12
    • 0042427258 scopus 로고    scopus 로고
    • An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue
    • Sapna Isotupa, K.P.; Stanford, D.A. An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue. Stochastic Models 2002, 18, 387-424.
    • (2002) Stochastic Models , vol.18 , pp. 387-424
    • Sapna Isotupa, K.P.1    Stanford, D.A.2
  • 13
    • 0037558031 scopus 로고
    • The bilingual server system: A queueing model featuring fully and partially qualified servers
    • Stanford, D.A.; Grassmann, W.K. The bilingual server system: a queueing model featuring fully and partially qualified servers. INFOR 1993, 31, 261-277.
    • (1993) INFOR , vol.31 , pp. 261-277
    • Stanford, D.A.1    Grassmann, W.K.2


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