Real-Time Healthcare Resource Management Planning Using Advanced Machine Learning Methods
Bibliographic record
Abstract
The purpose of this study is to develop predictive and optimization models to reduce patients' waiting time for diagnostic tests and medical treatments. Long wait times for receiving medical care is a pressing issue in the Canadian healthcare system. These wait times are spread over different phases of treatment, such as diagnostic tests, physicians' treatments, and appointments with specialists and surgeons. An integrated system to monitor all the phases of treatment along with efficient workload distribution in each phase can reduce patients' waiting time at each of these phases. This study investigates the impact of efficient resource allocation and workload distribution in the medical system. This research also explores the effect of optimized resource allocation on the patients' waiting time in Medicare settings. Resource allocation planning is directly related to the number of patient-arrival, and it is hard to predict such uncertain parameters in the future time frame. The number of patient-arrival also varies across different medical departments and different timeframes which makes the patient-arrival prediction challenging. The goal of this study is to investigate the forecasting effect on patients' waiting time and physicians' workload. To achieve this goal, advanced machine learning technique is integrated with the optimization model. The machine learning technique is used to predict the uncertain parameters of the optimization model for a shorter time span. To predict time-dependent uncertain parameters, such as patient arrival is a major issue, as the prediction may suffer from the concept drift problem. Besides, real-time data are commonly prone to errors due to irregular fluctuations, seasonal biases, and missing values in the data. On the other hand, predicting for shorter intervals requires lower execution time combined with higher accuracy. The developed predictive ensemble model in this research has addressed these issues legitimately with four research contributions. In the first contribution (Chapter 2), we have investigated methodologies for predicting Radiologists’ workload in a short time interval by adopting a machine learning technique. An ensemble model is proposed with the fixed batch training method in this part. To excel in the execution time, a fixed batch training method is used. Secondly, in Chapter 3, an Adaptive Batched-Ranked Ensemble (ABRE) model that reduces the effect of fluctuation using the time-variant windowing technique. Besides, a data aggregation technique is developed and integrated with the offline training phase of the proposed model to tackle the concept drift problem. In the third contribution (Chapter 4), a novel Ensemble of Pruned Regressor Chain (EPRC) method is developed and trained offline to predict uncertain parameters, such as patients’ arrival. Finally, the fourth contribution in Chapter 4, the EPRC method is integrated with a novel multi-objective optimization model to reduce patients’ waiting time, and to determine workload allocation for future timespan. This research enables enhanced decision-making with effective resource allocation and workload scheduling, as well as assists in reducing healthcare expenditure.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".