MétaCan
Menu
Back to cohort
Record W4415974692 · doi:10.1016/j.procs.2025.09.181

Improving Nurse Scheduling Using a Random Forest Algorithm to Predict Employee Well-Being

2025· article· en· W4415974692 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueProcedia Computer Science · 2025
Typearticle
Languageen
FieldDecision Sciences
TopicScheduling and Timetabling Solutions
Canadian institutionsAluminium Refining, Degassing and Filtering (Canada)Group for Research in Decision AnalysisUniversité du Québec à Chicoutimi
FundersMitacs
KeywordsRandom forestScheduling (production processes)OvertimeWork (physics)Linear programmingJob shop scheduling

Abstract

fetched live from OpenAlex

This paper introduces a new approach to nurse scheduling that integrates employee well-being into the decision-making process. A random forest regressor is trained to estimate a well-being score for each nurse, leveraging data from previous work weeks and considering multiple factors related to past schedules. This score is incorporated into a mixed-integer linear programming model to guide the assignment of shifts, aiming to better align schedules with individual needs. Nurses with lower well-being scores are prioritized for reduced overtime and increased shift preferences, promoting a fairer distribution of workload. The proposed method generates schedules that balance operational requirements with employee health, potentially mitigating fatigue and absenteeism.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.005
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.647
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0070.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.008
Science and technology studies0.0010.000
Scholarly communication0.0020.001
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.033
GPT teacher head0.345
Teacher spread0.312 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it