메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Approximate queueing network analysis of patient treatment times

Author keywords

Analytical Models and Approximation Methods; Queueing Theory

Indexed keywords

DISCRETE EVENT SIMULATION; FUNCTION EVALUATION; HOSPITALS; LAPLACE TRANSFORMS; PATIENT TREATMENT; PROBABILITY DENSITY FUNCTION; QUEUEING NETWORKS;

EID: 85086495253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/valuetools.2007.1775     Document Type: Conference Paper
Times cited : (9)

References (22)
  • 1
    • 0023326036 scopus 로고
    • Mean value analysis for blocking queueing networks
    • April
    • I.F. Akyildiz. Mean Value Analysis for blocking queueing networks. IEEE Transactions on Software Engineering, 14(4):418-428, April 1988.
    • (1988) IEEE Transactions on Software Engineering , vol.14 , Issue.4 , pp. 418-428
    • Akyildiz, I.F.1
  • 4
    • 33750216006 scopus 로고    scopus 로고
    • A closed queueing network approach to the analysis of patient flow in health care systems
    • T.J. Chaussalet, H. Xie, and P. Millard. A closed queueing network approach to the analysis of patient flow in health care systems. Methods of Information in Medicine, 45(5):492-497, 2006.
    • (2006) Methods of Information in Medicine , vol.45 , Issue.5 , pp. 492-497
    • Chaussalet, T.J.1    Xie, H.2    Millard, P.3
  • 5
    • 0035542631 scopus 로고    scopus 로고
    • Mathematical modelling of patient flow through an accident and emergency department
    • T.J. Coats and S. Michalis. Mathematical modelling of patient flow through an Accident and Emergency department. Emergency Medicine Journal, 18:190-192, 2001.
    • (2001) Emergency Medicine Journal , vol.18 , pp. 190-192
    • Coats, T.J.1    Michalis, S.2
  • 9
    • 0033902359 scopus 로고    scopus 로고
    • On teaching M/G/1 theory with extension to priority queues
    • January
    • P.G. Harrison. On teaching M/G/1 theory with extension to priority queues. IEE Proceedings-Computers and Digital Techniques., 147(1):23-26, January 2000.
    • (2000) IEE Proceedings-Computers and Digital Techniques. , vol.147 , Issue.1 , pp. 23-26
    • Harrison, P.G.1
  • 10
    • 0036041426 scopus 로고    scopus 로고
    • Passage time distributions in large Markov chains
    • Marina Del Rey, California, June
    • P.G. Harrison and W.J. Knottenbelt. Passage time distributions in large Markov chains. In Proc. ACM SIGMETRICS 2002, pages 77-85, Marina Del Rey, California, June 2002.
    • (2002) Proc. ACM SIGMETRICS 2002 , pp. 77-85
    • Harrison, P.G.1    Knottenbelt, W.J.2
  • 12
    • 16344392011 scopus 로고    scopus 로고
    • Modeling patient flows using a queuing network with blocking
    • February
    • N. Koizumi, E. Kuno, and T.E. Smith. Modeling patient flows using a queuing network with blocking. Health Care Management Science, 8(1):49-60, February 2005.
    • (2005) Health Care Management Science , vol.8 , Issue.1 , pp. 49-60
    • Koizumi, N.1    Kuno, E.2    Smith, T.E.3
  • 13
    • 28044472395 scopus 로고    scopus 로고
    • Evaluating a new approach for improving care in an accident and emergency department: The NU-care project
    • City University
    • L. Mayhew and E. Carney-Jones. Evaluating a new approach for improving care in an Accident and Emergency department: The NU-care project. Technical report, Cass Business School, City University, 2003.
    • (2003) Technical Report, Cass Business School
    • Mayhew, L.1    Carney-Jones, E.2
  • 14
    • 84896988360 scopus 로고    scopus 로고
    • Using queuing theory to analyse completion times in accident and emergency times in the light of the government 4-hour target
    • City University Actuarial Research Paper No. 177
    • L. Mayhew and D. Smith. Using queuing theory to analyse completion times in Accident and Emergency times in the light of the government 4-hour target. Technical report, Cass Business School, City University, 2006. Actuarial Research Paper No. 177.
    • (2006) Technical Report, Cass Business School
    • Mayhew, L.1    Smith, D.2
  • 16
    • 0025465277 scopus 로고
    • Approximate mean value analysis algorithms for queueing networks: Existence, uniqueness and convergence results
    • July
    • K.R. Pattipati, M.M. Kostreva, and J.L. Teele. Approximate Mean Value Analysis algorithms for queueing networks: existence, uniqueness and convergence results. Journal of the ACM, 37(3):643-673, July 1990.
    • (1990) Journal of the ACM , vol.37 , Issue.3 , pp. 643-673
    • Pattipati, K.R.1    Kostreva, M.M.2    Teele, J.L.3
  • 17
    • 2942620799 scopus 로고    scopus 로고
    • Approximate mean value analysis based on Markov chain aggregation by composition
    • July
    • D.C. Petrui and C.M. Woodside. Approximate Mean Value Analysis based on Markov chain aggregation by composition. Linear Algebra and its Applications, 386:335-358, July 2004.
    • (2004) Linear Algebra and its Applications , vol.386 , pp. 335-358
    • Petrui, D.C.1    Woodside, C.M.2
  • 18
    • 84896953138 scopus 로고    scopus 로고
    • Queues in health
    • University of Keele, Mathematics Department
    • J. Preater. Queues in health. Keele mathematics research report, University of Keele, Mathematics Department, 2001.
    • (2001) Keele Mathematics Research Report
    • Preater, J.1
  • 20
    • 0018999918 scopus 로고
    • Mean-value analysis of closed multiclass queuing networks
    • April
    • M. Reiser and S. Lavenberg. Mean-Value Analysis of closed multiclass queuing networks. Journal of the ACM, 27(2):313-322, April 1980.
    • (1980) Journal of the ACM , vol.27 , Issue.2 , pp. 313-322
    • Reiser, M.1    Lavenberg, S.2
  • 21
    • 0034140595 scopus 로고    scopus 로고
    • Experiments with improved approximate mean value analysis algorithms
    • H. Wang and K.C. Sevcik. Experiments with improved approximate Mean Value Analysis algorithms. Performance Evaluation, 39(1-4):189-206, 2000.
    • (2000) Performance Evaluation , vol.39 , Issue.1-4 , pp. 189-206
    • Wang, H.1    Sevcik, K.C.2


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