A stochastic model for the patient-bed assignment problem with random arrivals and departures
DOI10.1007/s10479-021-03982-9zbMath1500.90013OpenAlexW3167893272MaRDI QIDQ2171327
Mojtaba Heydar, Erin Trainer, Mark Fackrell, Małgorzata M. O'Reilly, Ali Tirdad, Peter G. Taylor
Publication date: 8 September 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-03982-9
simulationdynamic programmingMarkov chainoptimisationapproximate dynamic programmingemergency departmenthealth care modellingpatient-bed assignment problem
Queues and service in operations research (90B22) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- Perspectives of approximate dynamic programming
- Local search and lower bounds for the patient admission scheduling problem
- Approximate Dynamic Programming
- What you should know about approximate dynamic programming
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Approximate Dynamic Programming by Practical Examples
- Conditional phase-type distributions for modelling patient length of stay in hospital
This page was built for publication: A stochastic model for the patient-bed assignment problem with random arrivals and departures