The research, led by Zhi Li of Tiangong University with colleagues from The First Affiliated Hospital of Hebei North University and Tianjin Medical University Cancer Institute & Hospital, tackles the multi-priority admission problem across three clinically distinct departments: Endocrinology, Cardiology, and Nephrology. These units serve large populations of patients with multiple coexisting conditions, meaning that a single patient may be clinically appropriate for more than one department, and each department’s bed pool is contested by overlapping streams of demand. In such an environment, deciding which department should admit which patient, and when, is far from trivial.

At the heart of the study is a finite-horizon Markov Decision Process, a classical mathematical framework for sequential decision-making under uncertainty. In this formulation, the state of the system captures the number of available beds in each department at each decision epoch, while the actions available to the admission service centre include assigning an arriving patient to one of the eligible departments or rejecting the patient outright. The model’s reward structure combines the net benefit of a successful admission with an explicit penalty for balking, thereby quantifying what has long been an implicit and unmeasured cost: the harm done when a patient is refused admission because of bed shortages.

This balking penalty is the study’s key conceptual innovation. Traditional bed-allocation policies typically treat a rejection as a neutral event, or at best a minor loss, which encourages myopic decisions that fill beds in one department while pushing waiting patients toward eventual abandonment. By embedding the balking penalty directly into the objective function, the model forces the scheduler to weigh the immediate benefit of an admission against the future risk of a costlier rejection. The result is a more far-sighted policy that strategically reserves capacity in some departments to protect against demand surges in others.

Another distinctive feature is the dynamic multi-priority assignment mechanism, structured around first, second, and third admission attempts. Rather than committing to a single department at the moment of referral, the admission service centre can offer a patient to their first-choice department, and if capacity is unavailable, re-offer to second and third eligible alternatives. The MDP determines, at every state, which department to try first for each patient class and under what bed-availability conditions the scheduler should escalate to a lower-priority option or, ultimately, accept the balking penalty. This layered attempt structure mirrors the way skilled hospital coordinators actually work, but it optimizes those choices systematically rather than by intuition.

Because the state and action spaces of the model are finite, the authors employ a value iteration algorithm to solve the MDP and derive the optimal policy, which they label Policy-PC for Priority Cutoff. Value iteration repeatedly refines estimates of the expected total net benefit from each state until convergence, yielding a policy that specifies the best action at every possible configuration of bed occupancy and pending patient priority. The resulting cutoff structure has an intuitive interpretation: for each department and patient priority level, there is a bed-availability threshold below which the policy stops directing that patient class to the department, preserving its beds for patients who can be admitted nowhere else.

The empirical case is grounded in real-world hospital data drawn from the participating institutions. Using admission records and demand patterns from the Endocrinology, Cardiology, and Nephrology services, the team calibrated arrival rates, length-of-stay distributions, and clinical eligibility rules, then evaluated Policy-PC against four benchmark policies. The benchmarks include the widely used first-come, first-served discipline and a smallest-workload heuristic that routes each patient to the department with the lightest current burden. These comparisons were run across a designed set of experimental scenarios to test robustness under varying load conditions.

The computational results are striking. Policy-PC significantly reduced patient balking rates relative to all four benchmark policies, meaning fewer patients were turned away over the planning horizon. At the same time, the policy improved bed utilization, indicating that the gains came not from hoarding capacity but from allocating it more intelligently across the three departments. The study attributes this dual improvement to the priority cutoff thresholds, which absorb demand flexibly during busy periods while protecting access for the most constrained patient classes, ultimately balancing resource loads in a way that static allocation schemes cannot.

Beyond the headline numbers, the work offers hospital managers a practical decision-support tool. The MDP policy can be recomputed as demand patterns shift, and the explicit balking penalty gives administrators a tunable dial for balancing financial objectives against patient satisfaction and access. For multimorbid populations, who often face the longest waits and the highest clinical risk from delay, even modest reductions in balking can translate into meaningfully better outcomes. The authors suggest that the framework extends naturally to other department clusters and to richer settings involving elective and emergency streams competing for the same beds.

The research was supported by the National Natural Science Foundation of China and a Tianjin enterprise-funded research project, and it was approved by the ethics committee of The First Affiliated Hospital of Hebei North University. Published open access, the study arrives at a moment when health systems everywhere are searching for algorithmic levers to relieve congestion without new construction. By proving that a value-iteration-derived priority cutoff policy can simultaneously cut balking and raise utilization, the authors make a compelling case that the future of hospital admissions lies not in more beds alone, but in smarter, dynamically optimized decisions about the beds that already exist.

Subject of Research: Dynamic multi-priority hospital admission scheduling for multimorbid patients using a Markov decision process with balking penalties

Article Title: Dynamic multi-priority admission scheduling for multimorbid patients: an MDP approach incorporating balking penalties

Article References: Dynamic multi-priority admission scheduling for multimorbid patients: an MDP approach incorporating balking penalties. (n.d.). https://doi.org/10.1007/s40747-026-02476-0

Image Credits: AI Generated

DOI: 10.1007/s40747-026-02476-0

Keywords: hospital admission scheduling, multimorbid patients, Markov decision process, balking penalties, value iteration, bed utilization, queueing theory, healthcare operations, priority cutoff policy, admission control, hospital bed management, operations research