Abstract
We consider the online problem of scheduling patients with urgencies and preferences on hospital resources with limited capacity. To solve this complex scheduling problem effectively we have to address the following sub problems: determining the allocation of capacity to patient groups, setting dynamic rules for exceptions to the allocation, ordering timeslots based on scheduling efficiency, and incorporating patient preferences over appointment times in the scheduling process. We present a scheduling approach with optimized parameter values that solves these issues simultaneously. In our experiments, we show how our approach outperforms standard scheduling benchmarks for a wide range of scenarios, and how we can efficiently trade-off scheduling performance and fulfilling patient preferences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Vissers, J., Beech, R.: Health operations management: patient flow logistics in health care. Routledge, London (2005)
VanBerkel, P.T., Blake, J.T.: A comprehensive simulation for wait time reduction and capacity planning applied in general surgery. Health Care Management Science 10(4), 373–385 (2007)
Patrick, J., Puterman, M.L.: Improving resource utilization for diagnostic services through flexible inpatient scheduling: A method for improving resource utilization. Journal of the Operational Research Society 58, 235–245 (2007)
Bosman, P., Grahl, J., Thierens, D.: Enhancing the performance of maximum-likelihood gaussian edas using anticipated mean shift. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 133–143. Springer, Heidelberg (2008)
Branke, J., Mattfeld, D.: Anticipation in dynamic optimization: The scheduling case. In: Parallel Problem Solving from Nature, pp. 253–262. Springer, Heidelberg (2000)
Hopp, W.J., Spearman, M.: Factory Physics: The Foundations of Manufacturing Management, 2nd edn. Irwin/McGraw-Hill, Boston (2001)
van Dijk, N.M.: To pool or not to pool? the benefits of combining queuing and simulation. In: Proceedings WSC 2002, Winter Simulation Conference, San Diego, pp. 1469–1472 (2002)
Bowers, J., Mould, G.: Managing uncertainty in orthopaedic trauma theatres. European Journal of Operational Research 154(3), 599–608 (2004)
Vermeulen, I., Bohte, S., Elkhuizen, S., Lameris, J., Bakker, P., La Poutré, J.: Adaptive resource allocation for efficient patient scheduling. Artificial Intelligence in Medicine 46(1), 67–80 (2009)
Vermeulen, I., Bohte, S., Elkhuizen, S., Bakker, P., La Poutré, J.: Decentralized online scheduling of combination-appointments in hospitals. In: Proceedings of ICAPS 2008, pp. 372–379. AAAI Press, Menlo Park (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vermeulen, I.B., Bohte, S.M., Bosman, P.A.N., Elkhuizen, S.G., Bakker, P.J.M., La Poutré, J.A. (2009). Optimization of Online Patient Scheduling with Urgencies and Preferences. In: Combi, C., Shahar, Y., Abu-Hanna, A. (eds) Artificial Intelligence in Medicine. AIME 2009. Lecture Notes in Computer Science(), vol 5651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02976-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02976-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02975-2
Online ISBN: 978-3-642-02976-9
eBook Packages: Computer ScienceComputer Science (R0)