Key result
A proposed genetic algorithm for three-stage operating room surgery scheduling deviated from the lower bound by 3.25% on average with a computation time of 10.71 seconds.
Why the study?
Minimizing makespan in deterministic three-stage operating room surgery scheduling maximizes operating room utilization and improves patient satisfaction by enabling timely treatment.
A proposed genetic algorithm can efficiently find near-optimal solutions to the daily three-stage operating room surgery scheduling problem.
May optimize three-stage OR scheduling; leaves open real-world validation before practice change.
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.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2023) studied Operating room surgery scheduling. Genetic algorithm (GA) vs. Lower bound (LB) was evaluated on Makespan. A proposed genetic algorithm for three-stage operating room surgery scheduling deviated from the lower bound by 3.25% on average with a computation time of 10.71 seconds.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: