Random-key algorithms for optimizing integrated operating room scheduling
Random-key algorithms for optimizing integrated operating room scheduling
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.
Metaheuristic, Random-key optimizer, Reinforcement learning, Surgery scheduling
Salezze Vieira, Bruno
2865f641-a1e3-4793-b4a9-ab3360b73702
Machado Silva, Eduardo
7f50f030-8f7f-4960-b208-620a5bda3992
Chaves, Antônio Augusto
f48121e1-7f5f-41b5-91d0-36503578e4dd
14 June 2025
Salezze Vieira, Bruno
2865f641-a1e3-4793-b4a9-ab3360b73702
Machado Silva, Eduardo
7f50f030-8f7f-4960-b208-620a5bda3992
Chaves, Antônio Augusto
f48121e1-7f5f-41b5-91d0-36503578e4dd
Salezze Vieira, Bruno, Machado Silva, Eduardo and Chaves, Antônio Augusto
(2025)
Random-key algorithms for optimizing integrated operating room scheduling.
Applied Soft Computing, 180, [113368].
(doi:10.1016/j.asoc.2025.113368).
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.
Text
1-s2.0-S1568494625006799-main
- Version of Record
More information
Accepted/In Press date: 19 May 2025
e-pub ahead of print date: 11 June 2025
Published date: 14 June 2025
Keywords:
Metaheuristic, Random-key optimizer, Reinforcement learning, Surgery scheduling
Identifiers
Local EPrints ID: 503186
URI: http://eprints.soton.ac.uk/id/eprint/503186
ISSN: 1872-9681
PURE UUID: 95338b1d-9068-40c8-9b9a-1963e5740e23
Catalogue record
Date deposited: 23 Jul 2025 16:40
Last modified: 22 Aug 2025 02:42
Export record
Altmetrics
Contributors
Author:
Bruno Salezze Vieira
Author:
Eduardo Machado Silva
Author:
Antônio Augusto Chaves
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics