ArticleHealthcare (Basel, Switzerland)2023
Genetic Algorithm for Solving the No-Wait Three-Stage Surgery Scheduling Problem.
Article in Healthcare (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In this research, we consider a deterministic three-stage operating room surgery scheduling problem. The three successive stages are pre-surgery, surgery, and post-surgery. The no-wait constraint is considered among the three stages. Surgeries are known in advance (elective). Multiple resources are considered throughout the surgical process: PHU (preoperative holding unit) beds in the first stage, ORs (operating rooms) in the second stage, and PACU (post-anesthesia care unit) beds in the third stage. The objective is to minimize the makespan. The makespan is defined as the maximum end time of the last activity in stage 3. Minimizing the makespan not only maximizes the utilization of ORs but also improves patient satisfaction by allowing treatments to be delivered to patients in a timely manner. We proposed a genetic algorithm (GA) for solving the operating room scheduling problem. Randomly generated problem instances were tested to evaluate the performance of the proposed GA. The computational results show that overall, the GA deviated from the lower bound (LB) by 3.25% on average, and the average computation time of the GA was 10.71 s. We conclude that the GA can efficiently find near-optimal solutions to the daily three-stage operating room surgery scheduling problem.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.