메뉴 건너뛰기




Volumn 32, Issue 3, 2004, Pages 273-282

Approximations for Markovian multi-class queues with preemptive priorities

Author keywords

Approximations; Multi channel queues; Preemptive priorities

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; MARKOV PROCESSES; OPERATIONS RESEARCH; SERVERS;

EID: 0348170831     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.09.001     Document Type: Article
Times cited : (18)

References (14)
  • 1
    • 0022076035 scopus 로고
    • On the phase type approximation of general distributions
    • Altiok T. On the phase type approximation of general distributions. IIE Trans. 17(2):1985;110-116.
    • (1985) IIE Trans. , vol.17 , Issue.2 , pp. 110-116
    • Altiok, T.1
  • 3
    • 0020750232 scopus 로고
    • The response times of priority classes under preemptive resume in M/M/m queues
    • Buzen J.P., Bondi A.B. The response times of priority classes under preemptive resume in M/M/m queues. Oper. Res. 31(3):1983;456-465.
    • (1983) Oper. Res. , vol.31 , Issue.3 , pp. 456-465
    • Buzen, J.P.1    Bondi, A.B.2
  • 4
    • 0001258930 scopus 로고
    • On preemptive Markovian queue with multiple servers and two priority classes
    • Gail H.R., Hantler S.L., Taylor B.A. On preemptive Markovian queue with multiple servers and two priority classes. Math. Oper. Res. 17(2):1992;365-391.
    • (1992) Math. Oper. Res. , vol.17 , Issue.2 , pp. 365-391
    • Gail, H.R.1    Hantler, S.L.2    Taylor, B.A.3
  • 5
    • 0037268972 scopus 로고    scopus 로고
    • On multi-class, multi-server queuing
    • van Harten A., Sleptchenko A. On multi-class, multi-server queuing. Queueing Systems. 43(4):2003;307-328.
    • (2003) Queueing Systems , vol.43 , Issue.4 , pp. 307-328
    • Van Harten, A.1    Sleptchenko, A.2
  • 6
    • 0020204870 scopus 로고
    • Priority scheduling rules for repairable inventory systems
    • Hausman W., Scudder G. Priority scheduling rules for repairable inventory systems. Manage. Sci. 28:1982;1215-1232.
    • (1982) Manage. Sci. , vol.28 , pp. 1215-1232
    • Hausman, W.1    Scudder, G.2
  • 7
    • 0032654880 scopus 로고    scopus 로고
    • Analysis of nonpreemptive priority queues with multiple servers and two priority classes
    • Kao E.P.C, Wilson S.D. Analysis of nonpreemptive priority queues with multiple servers and two priority classes. European J. Oper. Res. 118:1999;181-193.
    • (1999) European J. Oper. Res. , vol.118 , pp. 181-193
    • Kao, E.P.C.1    Wilson, S.D.2
  • 8
    • 0019560808 scopus 로고
    • Multiprocessor systems with preemptive priorities
    • Mitrani I., King P.J.B. Multiprocessor systems with preemptive priorities. Performance Evaluation. 1:1981;118-125.
    • (1981) Performance Evaluation , vol.1 , pp. 118-125
    • Mitrani, I.1    King, P.J.B.2
  • 9
    • 0347109138 scopus 로고    scopus 로고
    • Analyzing multi-class, multi-server queueing systems with preemptive priorities
    • Faculty of Technology and Management, University of Twente, Enschede, the Netherlands, submitted for publication
    • A. Sleptchenko, A. van Harten, M.C. van der Heijden, Analyzing multi-class, multi-server queueing systems with preemptive priorities, Working Paper, Faculty of Technology and Management, University of Twente, Enschede, the Netherlands, 2002, submitted for publication.
    • (2002) Working Paper
    • Sleptchenko, A.1    Van Harten, A.2    Van der Heijden, M.C.3
  • 10
    • 0346478940 scopus 로고    scopus 로고
    • Using repair priorities to reduce stock investment in spare part networks
    • Faculty of Technology and Management, University of Twente, Enschede, the Netherlands, submitted for publication
    • A. Sleptchenko, M.C. van der Heijden, A. van Harten, Using repair priorities to reduce stock investment in spare part networks, Working paper, Faculty of Technology and Management, University of Twente, Enschede, the Netherlands, 2002, submitted for publication.
    • (2002) Working Paper
    • Sleptchenko, A.1    Van der Heijden, M.C.2    Van Harten, A.3
  • 12
    • 0020934970 scopus 로고
    • A numerical solution for the multi-server queue with hyper-exponential service times
    • de Smit J.H.A. A numerical solution for the multi-server queue with hyper-exponential service times. Oper. Res. Lett. 2(5):1983;392-419.
    • (1983) Oper. Res. Lett. , vol.2 , Issue.5 , pp. 392-419
    • De Smit, J.H.A.1
  • 13
    • 0019900567 scopus 로고
    • Approximating a point process by a renewal process I: Two basic methods
    • Whitt W. Approximating a point process by a renewal process I. two basic methods Oper. Res. 30:1982;125-147.
    • (1982) Oper. Res. , vol.30 , pp. 125-147
    • Whitt, W.1
  • 14
    • 84986958774 scopus 로고
    • Approximations for the GI/G/c queue
    • Whitt W. Approximations for the. GI/G/c queue Production Oper. Manage. 2:1993;144-161.
    • (1993) Production Oper. Manage. , vol.2 , pp. 144-161
    • Whitt, W.1


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