A dichotomic algorithm for an operating room scheduling problem

In this paper, we study an NP-hard operating room scheduling problem, consisting in a set of operations which have to be scheduled on identical operating rooms. In this problem, the operations are divided in groups; each one should be achieved by a single surgeon. The objective is to minimize the global completion time of the operations. We start by providing a mathematical model inspired from the two-dimensional Strip Packing problems and we compare its performances to the classical formulation. Then we introduce a dichotomic algorithm that we use to solve some larger instances of the problem.

[1]  John Bowers,et al.  Managing uncertainty in orthopaedic trauma theatres , 2004, Eur. J. Oper. Res..

[2]  Marie Jeanette Persson,et al.  Analysing management policies for operating room planning using simulation , 2010, Health care management science.

[3]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[4]  Ching-Fang Liaw,et al.  A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..

[5]  J. Everett,et al.  A Decision Support Simulation Model for the Management of an Elective Surgery Waiting System , 2002, Health care management science.

[6]  Pierre Ladet,et al.  OPERATING ROOMS SCHEDULING , 2006 .

[7]  Christian Prins,et al.  Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..

[8]  Antoine Jouglet,et al.  A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..

[9]  Gerhard J. Woeginger,et al.  Linear time approximation scheme for the multiprocessor open shop problem , 2001, Discret. Appl. Math..

[10]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[11]  R. Hall.  Patient flow : reducing delay in healthcare delivery , 2006 .

[12]  Mostafa Zandieh,et al.  Scheduling open shops with parallel machines to minimize total completion time , 2011, J. Comput. Appl. Math..

[13]  Abdelghani Bekrar,et al.  An Exact Method for the 2D Guillotine Strip Packing Problem , 2009, Adv. Oper. Res..

[14]  Nathalie Sauer,et al.  Heuristics for unrelated machine scheduling with precedence constraints , 1997 .

[15]  John T. Blake,et al.  Use of Linear Programming to Estimate Impact of Changes in a Hospital's Operating Room Time Allocation on Perioperative Variable Costs , 2002, Anesthesiology.

[16]  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.

[17]  Qi-Ming He,et al.  A Markovian queueing model for ambulance offload delays , 2013, Eur. J. Oper. Res..

[18]  Sándor P. Fekete,et al.  An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..

[19]  Brian T. Denton,et al.  Operating Room Pooling and Parallel Surgery Processing Under Uncertainty , 2011, INFORMS J. Comput..

[20]  David Pisinger,et al.  The two-dimensional bin packing problem with variable bin sizes and costs , 2005, Discret. Optim..

[21]  Brian T. Denton,et al.  Simulation of a Multiple Operating Room Surgical Suite , 2006, Proceedings of the 2006 Winter Simulation Conference.

[22]  John T. Blake,et al.  Calculating a Potential Increase in Hospital Margin for Elective Surgery by Changing Operating Room Time Allocations or Increasing Nursing Staffing to Permit Completion of More Cases: A Case Study , 2002, Anesthesia and analgesia.

[23]  Erik Demeulemeester,et al.  A branch-and-price approach for integrating nurse and surgery scheduling , 2008, Eur. J. Oper. Res..

[24]  Frank Werner,et al.  Constructive heuristic algorithms for the open shop problem , 1993, Computing.

[25]  Francisco Ruiz,et al.  Analysis via goal programming of the minimum achievable stay in surgical waiting lists , 2002, J. Oper. Res. Soc..

[26]  Vadim G. Timkovsky,et al.  Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity , 2003, Eur. J. Oper. Res..

[27]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[28]  Andreas Klinkert,et al.  Surgical case scheduling as a generalized job shop scheduling problem , 2008, Eur. J. Oper. Res..

[29]  Erik Demeulemeester,et al.  Operating room planning and scheduling: A literature review , 2010, Eur. J. Oper. Res..

[30]  Murray V. Calichman.  Creating an optimal operating room schedule. , 2005, AORN journal.

[31]  Brian T. Denton,et al.  Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty , 2010, Oper. Res..

[32]  R. Hall,et al.  Patient flow : reducing delay in healthcare delivery , 2006 .

[33]  Frank Werner,et al.  Heuristic constructive algorithms for open shop scheduling to minimize mean flow time , 2008, Eur. J. Oper. Res..

[34]  John T. Blake,et al.  Operating Room Managers’ Use of Integer Programming for Assigning Block Time to Surgical Groups: A Case Study , 2002, Anesthesia and analgesia.

[35]  Ching-Fang Liaw,et al.  Applying simulated annealing to the open shop scheduling problem , 1999 .

[36]  A. Dussauchoy,et al.  An operating theatre planning and scheduling problem in the case of a "block scheduling" strategy , 2006, 2006 International Conference on Service Systems and Service Management.

[37]  Franklin Dexter,et al.  Operating room utilization: information management systems , 2003, Current opinion in anaesthesiology.

[38]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[39]  Patrick De Causmaecker,et al.  A hybrid tabu search algorithm for automatically assigning patients to beds , 2010, Artif. Intell. Medicine.