A genetic algorithm provided optimal solutions for complex large-scale surgical scheduling problems, offering a flexible timetable that maximizes OR utilization and minimizes overtime.
Genetic algorithms provide an optimal and flexible solution for complex, large-scale surgical scheduling problems compared to mixed-integer linear programming.
The purpose of this work is to develop a master surgical scheduling for a case study of a large-scale public hospital in Thailand using a mixed-integer linear programming model (MILP) and a genetic algorithm (GA). Due to the high volume of operations that must be handled every day, our main objective is to create a schedule that maximizes OR utilization, minimizes room overtime, and reduces idle time between surgical patients. The data from Thammasat University Hospital were analyzed and simulated to generate a timetable from daily to weekly schedule. Our results show that an exact solution can be obtained by MILP for a simple problem while a large CPU run time is incurred for the complex problems. GA provided the optimal solution for a complex large-scale problem. The schedule generated by the proposed GA is more flexible and the staff can improve it to obtain more practical timetable in real-life situations, such as increasing the number of surgeries, setting a time block for specific surgical specialties, and handling emergency cases.
Atisattapong et al. (Thu,) conducted a other in Surgical scheduling. Mixed-integer linear programming model (MILP) and genetic algorithm (GA) was evaluated on Maximize OR utilization, minimize room overtime, and reduce idle time. A genetic algorithm provided optimal solutions for complex large-scale surgical scheduling problems, offering a flexible timetable that maximizes OR utilization and minimizes overtime.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: