Robust surgery loading

We consider the robust surgery loading problem for a hospital’s operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating room days. The objective is to maximize capacity utilization and minimize the risk of overtime, and thus cancelled patients. This research was performed in collaboration with the Erasmus MC, a large academic hospital in the Netherlands, which has also provided historical data for the experiments. We propose various constructive heuristics and local search methods that use statistical information on surgery durations to exploit the portfolio effect, and thereby to minimize the required slack. We demonstrate that our approach frees a lot of operating room capacity, which may be used to perform additional surgeries. Furthermore, we show that by combining advanced optimization techniques with extensive historical statistical records on surgery durations can significantly improve the operating room department utilization.

[1]  Paolo Dell'Olmo,et al.  Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size , 1999, Discret. Appl. Math..

[2]  Johann Hurink,et al.  A master surgical scheduling approach for cyclic scheduling in operating room departments , 2008, OR Spectr..

[3]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[4]  Eric Torng,et al.  Applying extra-resource analysis to load balancing , 2000, SODA '00.

[5]  Aleda V. Roth,et al.  HOSPITAL RESOURCE PLANNING: CONCEPTS, FEASIBILITY, AND FRAMEWORK , 1995 .

[6]  F. Dexter,et al.  Which algorithm for scheduling add-on elective cases maximizes operating room utilization? Use of bin packing algorithms and fuzzy constraints in operating room management. , 1999, Anesthesiology.

[7]  F. Dexter,et al.  Method to Assist in the Scheduling of Add‐on Surgical Cases‐Upper Prediction Bounds for Surgical Case Durations Based on the Log‐normal Distribution , 1998, Anesthesiology.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[10]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[11]  J Goldman,et al.  An evaluation of operating room scheduling policies. , 1969, The Hospital manager.

[12]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[13]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[14]  Rainer Kolisch,et al.  Adaptive search for solving hard project scheduling problems , 1996 .

[15]  R. Beech,et al.  Health Operations Management: Patient Flow Logistics in Health Care , 2005 .

[16]  Guochuan Zhang,et al.  On-line extensible bin packing with unequal bin sizes , 2009, Discret. Math. Theor. Comput. Sci..

[17]  John T. Blake,et al.  Mount Sinai Hospital Uses Integer Programming to Allocate Operating Room Time , 2002, Interfaces.

[18]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[19]  de G Guus Vries,et al.  A framework for production control in health care organizations , 2001 .

[20]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

[21]  Luis G. Vargas,et al.  Modeling the Uncertainty of Surgical Procedure Times: Comparison of Log-normal and Normal Models , 2000, Anesthesiology.

[22]  J. Belien,et al.  Integer programming for building robust surgery schedules , 2004 .

[23]  H. Markowitz Portfolio Selection: Efficient Diversification of Investments , 1971 .

[24]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[25]  P. Kuo,et al.  Optimization of operating room allocation using linear programming techniques. , 2003, Journal of the American College of Surgeons.

[26]  Franklin Dexter,et al.  Cost Implications of Various Operating Room Scheduling Strategies , 2002 .

[27]  Andreas Drexl,et al.  Scheduling of Project Networks by Job Assignment , 1991 .

[28]  Dale F. Cooper,et al.  Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation , 1976 .

[29]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[30]  O. Kallenberg Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[31]  I. Ozkarahan Allocation of Surgeries to Operating Rooms by Goal Programing , 2000, Journal of Medical Systems.

[32]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[33]  Jmh Jan Vissers,et al.  Master scheduling of medical specialists , 2004 .

[34]  Alain Guinet,et al.  Operating theatre planning. , 2003, Nursing mirror and midwives journal.

[35]  W. H. M. Zijm,et al.  Towards intelligent manufacturing planning and control systems , 2000, OR Spectr..