cs.LGMay 17, 2025

Rule-based and reinforcement-learning policies for resource allocation in a pediatric echo lab: a simulation study

Authors: Bozhi Sun, Seda Tierney, Jeffrey A. Feinstein, Frederick Damen, Alison L. Marsden, Daniele E. Schiavazzi

Organizations: Department of Applied and Computational Mathematics and Statistics, University of Notre Dame, Notre Dame, IN, USA. · Department of Pediatrics (Cardiology), Stanford University, CA 94305, US. · Department of Bioengineering, Stanford University, CA 94305, US.

Abstract

Scheduling echocardiographic examinations in a hospital setting presents significant challenges due to non-deterministic factors such as patient no-shows, variable arrival times, and heterogeneous exam durations, as well as asymmetric resource constraints between fetal and non-fetal patient streams. Fetal cases involve specialized ultrasound examinations performed during pregnancy, whereas non-fetal cases correspond to general diagnostic echocardiography services. Using one week (184 patients) of operational data from the Echo Laboratory at Stanford University's Lucile Packard Children's Hospital, we estimate patient no-show probabilities and derive empirical distributions of arrival times and exam durations, and use them to build a discrete-event stochastic simulation model using SimPy, exposed through an open-source Gymnasium interface (https://github.com/desResLab/echo_rl). As a baseline for policy optimization, we systematically compare two scheduling paradigms: on-the-fly allocation, in which patients are served according to their arrival time without prior reservations, and reservation-based allocation, in which varying proportions of resources are preassigned. We consider a hospital with seven ultrasound rooms (one equipped for both fetal and non-fetal exams, six for non-fetal exams only) and six sonographers (four qualified for both exam types, two for non-fetal exams only). In this setting, on-the-fly allocation markedly reduces the average patient waiting time compared with every reservation-based configuration tested. Building on this foundation, we train a Dueling Double Deep Q-Network (DQN) with prioritized experience replay to approximate an optimal dynamic on-the-fly allocation policy. The learned RL policy is comparable to, but does not outperform, the best on-the-fly rule-based policy.

Figures & tables

Appendix figures & tables28 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Adaptive Double-Booking Strategy for Outpatient Scheduling Using Multi-Objective Reinforcement Learning

    Mar 7, 2026Ninda Nurseha Amalina, Heungjo AnHealthcareMulti-Objective Reinforcement Learning

  2. Differentiating Through Dual Prices: End-to-End Policy Learning Under Capacity Constraints

    Aug 5, 2026Mohammadsaeed Haghi, Mahdi Salmani, Nima KelidariConstrained OptimizationDifferentiable Optimization

  3. Multi-Robot Multi-Queue Control via Exhaustive Assignment Actor-Critic Learning

    Apr 4, 2026Mohammad Merati, H. M. Sabbir Ahmad, Wenchao Li +1Multi-Robot Task AllocationRobot Policy Learning