PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 30, 2026Computers & Operations Research2 citationsOpen Access

A sample average approximation approach for an integrated operating room planning and scheduling problem under uncertainty: A real case study

View Full Paper
JMJose M. Molina-ParienteInstituto de Biomedicina de SevillaVFVictor Fernández-ViagasInstituto de Biomedicina de SevillaSLSandra LealInstituto de Biomedicina de Sevilla

Key Points

  • The aim is to optimize the sequence of patients in operating rooms to minimize costs and prioritize elective surgeries effectively.
  • Analyzed a real case from a Spanish hospital's Plastic Surgery and Major Burns service.
  • Developed a sample average approximation approach combining deterministic metaheuristics and Monte Carlo simulation.
  • Compared an iterated greedy algorithm with other established metaheuristics to find the most effective solution.
  • The iterated greedy metaheuristic was identified as the best method for the deterministic problem.
  • The sample average approximation converged at an exponential rate with the number of samples, achieving an optimality index of around 1.0%.
  • Insights were provided on balancing solution robustness and hospital performance indicators.

Abstract

This paper presents a real case of an operating room planning and scheduling problem under stochastic surgery durations and the arrivals of non-elective patients. This problem arises from the Plastic Surgery and Major Burns service at a Spanish hospital. The objective is twofold: (1) to determine the best sequence of patients in each operating room per day to minimize the total expected cost of surgical resources, and (2) to prioritize elective patients with the highest clinical weights (medical priority and waiting time). The service uses a dedicated operating room distribution policy, i.e., each operating room available on a given day within the planning horizon is assigned exclusively to either elective or non-elective patients. To the best of our knowledge, this problem has not been previously reported in the literature. To solve this stochastic problem in practice, we propose a sample average approximation approach that combines a deterministic metaheuristic and Monte Carlo simulation. To decide which deterministic metaheuristic to embed most efficiently in the procedure, we compare a new iterated greedy algorithm with the most promising metaheuristics from the literature. The results show that the proposed iterated greedy metaheuristic is statistically the best method for solving the deterministic version of the problem. Regarding the sample average approximation, the results show that this procedure converges at an exponential rate with the number of samples using real data from the service under study, resulting in an optimality index value of approximately 1.0%. We also analyze the impact of the sample size in solving the real problem, aiming to balance the robustness of the solution and the key performance indicators set by the hospital. Finally, we discuss several managerial insights for the service under study, including a comparison of dedicated and flexible operating room distribution.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Molina-Pariente et al. (2026) studied this question.

synapsesocial.com/papers/69ca12d4883daed6ee095072https://doi.org/10.1016/j.cor.2026.107476
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Integrated operating room planning and scheduling: an ILP-Based off-line approach for emergency responsiveness at a local hospital in Naples2024 · 11 citations
  2. 2A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem2006 · 1,134 citations
  3. 3First vs. best improvement: An empirical study2005 · 116 citations
  4. 4Optimization of surgery sequencing and scheduling decisions under uncertainty2006 · 558 citations
  5. 5Mount Sinai Hospital Uses Integer Programming to Allocate Operating Room Time2002 · 213 citations