Markov chain analysis for the neonatal inpatient flow in a hospital.

Abstract

Discrete-time Markov chain and queueing-theoretic models are used to quantitatively formulate the flow of neonatal inpatients over several wards in a hospital. Parameters of the models are determined from the operational analysis of the record of the numbers of admission/departure for each ward every day and the order log of patient movement from ward to ward for two years provided by the Medical Information Department of the University of Tsukuba Hospital in Japan. Our formulation is based on the analysis of the precise routes (the route of an inpatient is defined as a sequence of the wards in which he/she stays from admission to discharge) and their length-of-stay (LoS) in days in each ward on their routes for all neonatal inpatients. Our theoretical model calculates the probability distribution for the number of patients staying in each ward per day which agrees well with the corresponding histogram observed for each ward as well as for the whole hospital. The proposed method can be used for the long-term capacity planning of hospital wards with respect to the probabilistic bed utilization.