Improving Hospital-wide Patient Scheduling Decisions by Clinical Pathway Mining.
Recent research has highlighted the need for solving hospital-wide patient scheduling problems. Inpatient scheduling, patient activities have to be scheduled on scarce hospital resources such that temporal relations between activities (e.g. for recovery times) are ensured. Common objectives are, among others, the minimization of the length of stay (LOS). In this paper, we consider a hospital-wide patient scheduling problem with LOS minimization based on uncertain clinical pathways. We approach the problem in three stages: First, we learn most likely clinical pathways using a sequential pattern mining approach. Second, we provide a mathematical model for patient scheduling and finally, we combine the two approaches. In an experimental study carried out using real-world data, we show that our approach outperforms baseline approaches on two metrics.
The H. John Heinz III College, Carnegie Mellon University, Pittsburgh, PA, USA.
Daniel
D
Gartner
Institute for Operations Research, Discrete Optimization, Karlsruhe Institute of Technology, Karlsruhe, Germany.
Ines V
IV
Arnolds
Institute for Operations Research, Discrete Optimization, Karlsruhe Institute of Technology, Karlsruhe, Germany.
Stefan
S
Nickel
D001071:Appointments and Schedules; D003198:Computer Simulation; D019091:Critical Pathways / Q000706:statistics & numerical data*; D057225:Data Mining / Q000379:methods; D020000:Decision Support Systems, Clinical; D003661:Decision Support Techniques; D057286:Electronic Health Records / Q000145:classification / Q000706:statistics & numerical data*; D005858:Germany; D006760:Hospitalization; D015233:Models, Statistical; D058996:Quality Improvement / Q000458:organization & administration*