| Full text | |
| Author(s): |
Vieira, Bruno Salezze
;
Silva, Eduardo Machado
;
Chaves, Antonio Augusto
Total Authors: 3
|
| Document type: | Journal article |
| Source: | APPLIED SOFT COMPUTING; v. 180, p. 25-pg., 2025-08-01. |
| Abstract | |
Efficient surgery room scheduling is essential for hospital efficiency, patient satisfaction, and resource utilization. This study addresses the challenge as a combinatorial optimization problem that incorporates multi-room scheduling, equipment scheduling, and complex availability constraints for rooms, patients, and surgeons, facilitating rescheduling and enhancing operational flexibility. To solve such a problem, we introduce multiple algorithms based on a Random-Key Optimizer (RKO), coupled with relaxed formulations to compute lower bounds efficiently, rigorously tested on literature and new, real-world-based instances. The RKO approach decouples the problem from the solving algorithms through an encoding/decoding layer, making it possible to use the same solving algorithms to multiple room scheduling problems case studies from multiple hospitals, given the particularities of each place, even other optimization problems. Among the possible RKO algorithms, we design the heuristics Biased Random-Key Genetic Algorithm with Q-Learning, Simulated Annealing, and Iterated Local Search for use within an RKO framework, employing a single decoder function. The proposed heuristics, complemented by the lower-bound formulations, provided optimal gaps for evaluating the effectiveness of the heuristic results. Our results demonstrate significant lower-and upper-bound improvements for the literature instances, notably in proving one optimal result. Our strong statistical analysis shows the effectiveness of our implemented heuristic search mechanisms. Furthermore, the best-proposed heuristic efficiently generates schedules for the newly introduced instances, even in highly constrained scenarios. This research offers valuable insights and practical solutions for improving surgery scheduling processes, delivering tangible benefits to hospitals by optimizing resource allocation, reducing patient wait times, and enhancing overall operational efficiency. (AU) | |
| FAPESP's process: | 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 18/15417-8 - Development of a hybrid metaheuristic with adaptive control flow and parameters |
| Grantee: | Antônio Augusto Chaves |
| Support Opportunities: | Research Grants - Young Investigators Grants - Phase 2 |
| FAPESP's process: | 23/04588-4 - Mathematical models and adaptive solution methods for the multi-period cutting stock problem with setups and capacity constraints |
| Grantee: | Eduardo Machado Silva |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 21/09482-4 - Models and methods to solve the patient bed assignment problem and the operation room scheduling problem |
| Grantee: | Bruno Salezze Vieira |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 24/08848-3 - Full truckload pickup and delivery problem: optimization methods and practical constraints of the supply chain middle mile |
| Grantee: | Antônio Augusto Chaves |
| Support Opportunities: | Regular Research Grants |