Data-Driven Bed Capacity Planning Using $M_t/G_t/\infty$ Queueing Models with an Application to Neonatal Intensive Care Units
Bibliographic record
Abstract
Hospitals face challenges in long-term intensive care unit (ICU) capacity planning under uncertain demand. Admission rates fluctuate over time, and LOS distributions vary with patient heterogeneity, hospital location, case mix, and clinical practice. Common approaches rely on steady-state queueing models or heuristic rules with fixed parameters, which often fail to capture real occupancy dynamics. The widely used 85% occupancy rule, for example, recommends keeping average utilization below this level to preserve responsiveness, yet it is grounded in stationary assumptions and may lack resilience in time-varying systems. Our analysis shows that even when long-run utilization targets are satisfied, daily occupancy often exceeds 100% capacity. We propose a data-driven framework to estimate ICU bed occupancy using an $M_t/G_t/\infty$ queueing model with time-varying arrival rates and empirically fitted LOS distributions. The approach combines statistical decomposition and parametric fitting to capture temporal patterns in admissions and LOS, and is applied to multi-year data from neonatal ICUs (NICUs) in Calgary. We evaluate capacity scenarios including average-based thresholds and Poisson-based surge estimates. Results show that static heuristics are inadequate under fluctuating demand and underscore the importance of modeling LOS variability when estimating bed needs. Although the case study focuses on NICUs, the framework has potential applicability to other ICU settings and provides interpretable, data-informed support for systems facing rising demand and constrained capacity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".