×

A stochastic model for the patient-bed assignment problem with random arrivals and departures. (English) Zbl 1500.90013

Summary: We consider the patient-to-bed assignment problem that arises in hospitals. Both emergency patients who require hospital admission and elective patients who have had surgery need to be found a bed in the most appropriate ward. The patient-to-bed assignment problem arises when a bed request is made, but a bed in the most appropriate ward is unavailable. In this case, the next-best decision out of a many alternatives has to be made, according to some suitable decision making algorithm. We construct a Markov chain to model this problem in which we consider the effect on the length of stay of a patient whose treatment and recovery consists of several stages, and can be affected by stays in or transfers to less suitable wards. We formulate a dynamic program recursion to optimise an objective function and calculate the optimal decision variables, and discuss simulation techniques that are useful when the size of the problem is too large. We illustrate the theory with some numerical examples.

MSC:

90B22 Queues and service in operations research
90B80 Discrete location and assignment
90C39 Dynamic programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abera, A. K., O’Reilly, M. M., Holland, B. R., Fackrell, M., & Heydar, M. (2019). Decision support model for the patient admission scheduling problem with random arrivals and departures. In Proceedings of the 10th international conference on matrix-analytic methods in Stochastic models, 13-15 February 2019, Hobart, Australia (pp. 10-14).
[2] Abera, AK; O’Reilly, MM; Holland, BR; Fackrell, M.; Heydar, M., On the decision support model for the patient admission scheduling problem with random arrivals and departures: A solution approach, Stochastic Models, 30, 2, 312-336 (2020) · doi:10.1080/15326349.2020.1742161
[3] Ceschia, S.; Schaerf, A., Local search and lower bounds for the patient admission scheduling problem, Computers and Operations Research, 38, 10, 1452-1463 (2011) · Zbl 1208.90110 · doi:10.1016/j.cor.2011.01.007
[4] Ceschia, S.; Schaerf, A., Modeling and solving the dynamic patient admission scheduling problem under uncertainty, Artificial Intelligence in Medicine, 56, 3, 199-205 (2012) · doi:10.1016/j.artmed.2012.09.001
[5] Ceschia, S.; Schaerf, A., Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays, Journal of Scheduling, 19, 4, 377-389 (2016) · Zbl 1347.90036 · doi:10.1007/s10951-014-0407-8
[6] Cumani, A., On the canonical representation of homogeneous Markov processes modelling failure—time distributions, Microelectronics Reliability, 22, 3, 583-602 (1982) · doi:10.1016/0026-2714(82)90033-6
[7] Fackrell, M., Modelling healthcare systems with phase-type distributions, Health Care Management Science, 12, 1, 11-26 (2009) · doi:10.1007/s10729-008-9070-y
[8] Hulshof, PJH; Mes, MRK; Boucherie, RJ; Hans, EW, Patient admission planning using approximate dynamic programming, Flexible Services and Manufacturing Journal, 28, 1-2, 30-61 (2016) · doi:10.1007/s10696-015-9219-1
[9] Latouche, G.; Ramaswami, V., Introduction to Matrix Analytic Methods in Stochastic Modelling (1999), Princeton, NJ: ASA SIAM, Princeton, NJ · Zbl 0922.60001 · doi:10.1137/1.9780898719734
[10] Marshall, AH; McClean, SI, Conditional phase-type distributions for modelling patient length of stay in hospital, International Transactions in Operational Research, 10, 6, 565-576 (2003) · Zbl 1046.60014 · doi:10.1111/1475-3995.00428
[11] Mes, MR; Rivera, AP; Boucherie, R.; van Dijk, N., Approximate dynamic programming by practical examples, Markov decision processes in practice. International series in operations research and management science, 63-101 (2017), Cham: Springer, Cham · Zbl 1375.90302
[12] Powell, W., What you should know about approximate dynamic programming, Naval Research Logistics, 56, 3, 239-249 (2009) · Zbl 1158.90418 · doi:10.1002/nav.20347
[13] Powell, W., Approximate dynamic programming: Solving the curses of dimensionality (2011), Boca Raton: Wiley, Boca Raton · Zbl 1242.90002 · doi:10.1002/9781118029176
[14] Powell, WB, Perspectives of approximate dynamic programming, Annals of Operations Research, 241, 1-2, 319-356 (2016) · Zbl 1348.90612 · doi:10.1007/s10479-012-1077-6
[15] Vancroonenburg, W., De Causmaecker, P., & Vanden Berghe, G. (2012). Patient-to-room assignment planning in a dynamic context. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT-2012) (pp. 193-208).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.