Timeslot allocation for waiting list control
Y.M. van der Vlugt, J.T. van Essen, R.F.M. Vromans, M. Carlier

TL;DR
This paper develops and tests decision-making methods for hospital timeslot allocation to reduce patient wait times and optimize capacity, using Markov decision processes and simulation on real hospital data.
Contribution
It introduces a novel approach combining MDP modeling, approximate solution techniques, and a hybrid static-dynamic allocation method for hospital scheduling.
Findings
All proposed methods outperform static allocation.
The linear programming approach yields the best results.
Allocating 60% of timeslots statically and 40% dynamically is optimal.
Abstract
As pressure on the healthcare system increases, patients that require elective surgery experience longer access times to pre- and post-operative appointments and surgery. Hospitals can control their waiting lists by allocating timeslots to different types of appointments. To allow appointments to be planned timely, this allocation is decided several weeks in advance. However, the consequences of the timeslot allocation are uncertain, as not all patients follow the same treatment pathway. Furthermore, as these planning decisions are made in advance, they are based on an uncertain prediction of future waiting lists. We aim to develop methods that support hospitals in timeslot allocation to reduce access times for patients and ensure that all available capacity is used. The problem is modelled as a Markov decision process (MDP). As the state space is very large, we use least-squares policy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Advanced Queuing Theory Analysis · Optimization and Search Problems
