메뉴 건너뛰기
Mathematical Methods of Operations Research
Volumn 47, Issue 3, 1998, Pages 351-353
The M/M/c with Critical Jobs
Author keywords

Bounds; M M c; Matrix methods; Priority queue
Indexed keywords

EID: 1942425091     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01198401     Document Type: Article
Times cited : (2)
References (13)
  • 1
    • 21344497175 scopus 로고
    • Upper and lower bounds for the waiting time in the symmetric shortest queue system
    • Adan IJBF, Van Houtum GJ, Van der Wal J (1994) Upper and lower bounds for the waiting time in the symmetric shortest queue system. Annals of Operat. Research 48:197-217
    • (1994) Annals of Operat. Research , vol.48 , pp. 197-217
    • Adan, I.J.B.F.1    Van Houtum, G.J.2    Van der Wal, J.3
  • 2
    • 0007303910 scopus 로고    scopus 로고
    • The symmetric longest queue system
    • _(1997) The symmetric longest queue system. Stochastic Models 13:105-120
    • (1997) Stochastic Models , vol.13 , pp. 105-120
  • 4
    • 0023994936 scopus 로고
    • Simple bounds for queueing systems with breakdowns
    • Van Dijk NM (1988) Simple bounds for queueing systems with breakdowns. Perf. Evaluation 8:117-128
    • (1988) Perf. Evaluation , vol.8 , pp. 117-128
    • Van Dijk, N.M.1
  • 5
    • 0007316118 scopus 로고
    • A formal proof for the insensitivity of simple bounds for finite multi-server nonexponential tandem queues
    • _(1988) A formal proof for the insensitivity of simple bounds for finite multi-server nonexponential tandem queues. Stochastic Processes 27:261-277
    • (1988) Stochastic Processes , vol.27 , pp. 261-277
  • 6
    • 0024015878 scopus 로고
    • Simple bounds for finite single-server exponential tandem queues
    • Van Dijk NM, Lamond BF (1988) Simple bounds for finite single-server exponential tandem queues. Opns. Res. 36:470-477
    • (1988) Opns. Res. , vol.36 , pp. 470-477
    • Van Dijk, N.M.1    Lamond, B.F.2
  • 7
    • 0002964518 scopus 로고
    • Simple bounds and monotonicity results for finite multi-server exponential tandem queues
    • Van Dijk NM, Van der Wal J (1989) Simple bounds and monotonicity results for finite multi-server exponential tandem queues. QUESTA 4:1-16
    • (1989) QUESTA , vol.4 , pp. 1-16
    • Van Dijk, N.M.1    Van der Wal, J.2
  • 8
    • 84976032167 scopus 로고
    • On the assignment of customers to parallel queues
    • Hordijk A, Koole G (1992) On the assignment of customers to parallel queues. PEIS 6:495-511
    • (1992) PEIS , vol.6 , pp. 495-511
    • Hordijk, A.1    Koole, G.2
  • 9
    • 21344482962 scopus 로고
    • A logarithmic reduction algorithm for quasi-birth-death processes
    • Latouche G, Ramaswami V (1993) A logarithmic reduction algorithm for quasi-birth-death processes. J. Appl. Prob. 30:650-674
    • (1993) J. Appl. Prob. , vol.30 , pp. 650-674
    • Latouche, G.1    Ramaswami, V.2
  • 12
    • 1942461088 scopus 로고
    • Approximate analysis of an M/G/1 priority queue with priority changes due to impatience
    • De Waal PR (1992) Approximate analysis of an M/G/1 priority queue with priority changes due to impatience. CWI Report BS-R9202
    • (1992) CWI Report , vol.BS-R9202
    • De Waal, P.R.1
  • 13
    • 0011656181 scopus 로고
    • Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
    • Van der Wal J (1989) Monotonicity of the throughput of a closed exponential queueing network in the number of jobs. OR Spektrum 11:97-100
    • (1989) OR Spektrum , vol.11 , pp. 97-100
    • Van der Wal, J.1

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