Advanced Stochastic Programming and Machine Learning \nModels for Healthcare Planning, Scheduling, and \nPrediction Problems
Bibliographic record
Abstract
The increasing demand for global healthcare systems highlights the urgent need for innovative solutions. In response to this challenge, we uses advanced Stochastic Programming and Machine Learning methods to introduce significant improvements in appointment scheduling, operating room planning, and modeling and prediction of the COVID-19 pandemic. \n \nIn the first paper, we study the healthcare appointment scheduling problem. The main challenges in appointment scheduling are uncertainties in no-shows, unpunctuality, and service times. We propose a novel stochastic programming model that captures an exponential number of scenarios using a pseudo-polynomial number of variables and constraints without relying on sampling methods. The presented methodology is exact. We show that the generated schedules reduce total costs by 34% on average by incorporating patient-dependent service times, 12% by considering patient-and-time-dependent unpunctuality, and 67% by integrating patient-and-time-dependent no-shows. In addition, we show that personalized reminders have the potential to reduce total costs by 23%. \n \nIn the second paper, we study a stochastic operating room planning problem. The unpredictability of surgical durations poses a considerable challenge to efficient OR planning. Existing models often overlook this source of uncertainty. This paper introduces a novel stochastic programming model that effectively manages the uncertainty in surgical times. This model advances the literature by capturing an exponential number of scenarios in a weekly operating room planning problem without sampling, simplifications, or approximations. The results of the computational experiments revealed that our model obtains feasible solutions with an average optimality gap of 0.78% for instances with 80 surgeries and 1.48E+64 scenarios. \n \nIn the third, fourth and fifth papers, we focus on modeling and prediction of the COVID-19 pandemic and aim at developing methodologies that inform and guide public health decisions. In these three papers, we proposed a hybrid reinforcement learning based algorithm as well as two other evolutionary computation based algorithms to forecast the spread of the COVID-19 pandemic. By applying these methods to real-world data from Canada, Quebec, Ontario, France and the U.S., we aim to offer insights into effective pandemic response strategies. We predict the pandemic trajectory as well as the number of different cases with high accuracy.
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.003 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| 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.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.004 | 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".