Strategic and tactical decision-making for inpatient admission and hospital bed allocation: an application to neurology wards
Notice bibliographique
Résumé
The healthcare sector has received constant appeals from different stakeholders over the past decades to increase operational efficiency and enhance quality of care for patients. Hospital managers and health authorities confront serious challenges in identifying areas for improvement and designing plans to boost healthcare delivery processes, all while maintaining the operational costs aligned with their planned budget. The difficulty of this task is amplified by budget cuts and insufficient resources in the healthcare system. Operations Research models can be used to assist healthcare managers in making informed and evidence-based decisions. This thesis aims at developing patient admission and bed allocation policies in acute care wards, where acquiring extra resources is extremely expensive for hospitals and a delay in treatment is highly undesirable from a patient health perspective. The problem of patient admission and inpatient bed allocation in acute care wards recognizing multiple patient types with different medical characteristics is considered in this thesis. Recent studies have shown that in the event of an acute episode patients are more effectively treated in specialized inpatient settings. The benefits of such specialized care, however, might be offset by long wait times at the emergency department due to bed unavailability in the ward. This research is inspired by the managerial challenges at the neurology ward of the Montreal Neurological Hospital, where the optimal care pathway for patients with neurological diseases is particularly time-sensitive. Failure in matching the hospital's service capacity and patient demand for certain levels of care can be problematic. Moreover, day-to-day fluctuations in demand affect the efficient utilization of hospital capacity. The key issue for matching the demand and service capacity and improving the performance of the hospital is intelligently designed capacity-related policies; both at the strategic and tactical levels. At the tactical level, the admission process of patients to a neurology ward is modeled using an average cost dynamic programming framework. By solving the dynamic program model, we are essentially looking for the dynamic admission policy that provides the best care for all patients in light of limited bed availability. In terms of solution methodology, an integrated approach that combines queuing models and approximate dynamic programming is presented. Furthermore, the performance of the proposed approach is compared with the performance of other heuristic policies that can be suggested for such types of problems. It is shown that the dynamic admission policy that can adjust allocations of the beds based on the state of the ward performs better compared with other static policies. In particular, the dynamic admission policy reduces the average ED boarding time that patients experience before they are transferred to the ward.At the strategic level, the problem of multi-site resource allocation and system configuration in response to the pending merger of two existing sites, i.e., the stroke wards at Montreal Neurological Hospital and Montreal General Hospital, is studied. Designing an appropriate admission policy for patients at the hospital level along with an optimal bed allocation policy between the two sites are the major concerns of hospital managers in this process. Two possible settings for admission of patients to the hospitals are examined to determine which setting would be preferred in terms of minimizing the patient admission refusal rate. Meanwhile, the multi-site bed allocation problem is formulated so that resources are optimally distributed in accordance with the patient flow at each site. It is found that the decision of system configuration for a multi-hospital network requires careful consideration of patient mix in the arrivals, relative length of stay of patients, and the distribution of patient load between hospitals.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,006 | 0,014 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,002 | 0,002 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,003 | 0,002 |
| Communication savante | 0,005 | 0,002 |
| Science ouverte | 0,002 | 0,004 |
| Intégrité de la recherche | 0,006 | 0,005 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,009 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».