An improved Lagrangian relaxation heuristic for the scheduling problem of operating theatres

We have developed bi-objective model for the scheduling problem of operating theatres.The objectives are the relative cost of the operating theatre and the satisfaction of patients.A Lagrangian relaxation method has been proposed.A branch and bound algorithm has been presented to solve the dual problems.Experiments have been designed to analyze the performance of the Lagrangian relaxation algorithm. Due to the greatest importance of operating theatres in hospitals, this paper focuses on generating an optimal surgery schedule of elective-patients in multiple operating theatres, which considers three stages: the preoperative, perioperative, and postoperative stage. The scheduling problems of operating theatres allocate hospital resources to individual surgical cases and decide on the time to perform the surgeries in each stage. The problem consists of assigning patients to different resources in any surgical stage in order to minimize related costs of the system and maximize the satisfaction of patients. This paper establishes an integer programming model and presents a new Lagrangian relaxation algorithm for this problem. In this algorithm, precedence constraints are relaxed by Lagrangian multipliers. In this way the relaxed problem can be decomposed into multiple stage level subproblems, each of which corresponds to a specific stage. A branch and bound algorithm is designed for solving these subproblems via developing a lower bound and dominance rules. The multipliers are then iteratively updated along a subgradient direction. Finally, the new algorithm is computationally compared with the commonly used Lagrangian relaxation algorithms which, after precedence constraints are relaxed, decompose the relaxed problem into stage level subproblems and solve the subproblems by using the dynamic programming algorithms. Numerical results show that the designed Lagrangian relaxation method produces better schedules with much smaller duality gap in acceptable computational time, especially for large-scale problems. Also, the case study shows that the application of the proposed theory results in noticeable cost saving.

[2]  Latifa Dekhici,et al.  Operating Theatre Scheduling Under Constraints , 2010 .

[3]  F. Riane,et al.  Operating Theatre Optimization : A Resource-Constrained Based Solving Approach , 2006, 2006 International Conference on Service Systems and Service Management.

[4]  A. Hanset,et al.  Using constraint programming to schedule an operating theatre , 2010, 2010 IEEE Workshop on Health Care Management (WHCM).

[5]  S. Prasanna Devi,et al.  Prediction of Surgery Times and Scheduling of Operation Theaters in Optholmology Department , 2012, Journal of Medical Systems.

[6]  Masahiro Inuiguchi,et al.  A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness , 2007, 2007 IEEE International Conference on Automation Science and Engineering.

[7]  Chengbin Chu,et al.  A planning and scheduling problem for an operating theatre using an open scheduling strategy , 2010, Comput. Ind. Eng..

[8]  M. Souki,et al.  Heuristics for the Operating Theatre Planning and Scheduling , 2010, J. Decis. Syst..

[9]  Tiberiu Ezri,et al.  Efficiency of the operating room suite. , 2003, American journal of surgery.

[10]  Lixin Tang,et al.  Lagrangian Relaxation Algorithms for Re-entrant Hybrid Flowshop Scheduling , 2008, 2008 International Conference on Information Management, Innovation Management and Industrial Engineering.

[11]  Sang-Oh Shim,et al.  Generating subproblems in branch and bound algorithms for parallel machines scheduling problem , 2009, Comput. Ind. Eng..

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

[13]  Vincent Augusto,et al.  Operating theatre scheduling using Lagrangian relaxation , 2008 .

[14]  Tianyou Chai,et al.  A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process , 2014, Eur. J. Oper. Res..

[15]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..

[16]  Jan Vissers,et al.  Patient mix optimisation and stochastic resource requirements: A case study in cardiothoracic surgery planning , 2009, Health care management science.

[17]  Mu-Chun Su,et al.  A SOMO-based approach to the operating room scheduling problem , 2011, Expert Syst. Appl..

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

[19]  Wang Yu,et al.  A particle swarm optimization algorithm on the surgery scheduling problem with downstream process , 2013, 2013 25th Chinese Control and Decision Conference (CCDC).

[20]  Xiaolan Xie,et al.  Operating theatre scheduling with patient recovery in both operating rooms and recovery beds , 2010, Comput. Ind. Eng..

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

[22]  Xiaolan Xie,et al.  Patients scheduling in a hospital operating theatre , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[23]  Nadine Meskens,et al.  Multi-objective operating room scheduling considering desiderata of the surgical team , 2013, Decis. Support Syst..

[24]  Said Salhi,et al.  Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem , 2013 .

[25]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[26]  Pratik J. Parikh,et al.  A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital , 2013, Eur. J. Oper. Res..

[27]  E. Tànfani,et al.  Improving surgery department performance via simulation and optimization , 2010, 2010 IEEE Workshop on Health Care Management (WHCM).

[28]  Chengbin Chu,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.

[29]  Erhan Kozan,et al.  Reactive scheduling model for the operating theatre , 2012 .

[30]  Wei Xiang,et al.  Surgical Scheduling Based on Hybrid Flow-Shop Scheduling , 2012 .

[31]  Roberto Aringhieri,et al.  A two level metaheuristic for the operating room scheduling and assignment problem , 2015, Comput. Oper. Res..

[32]  Elena Tanfani,et al.  A three-phase approach for operating theatre schedules , 2007, Health care management science.

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

[34]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

[35]  Xiaolan Xie,et al.  Column generation approach to operating theater planning with elective and emergency patients , 2008 .

[36]  Chengbin Chu,et al.  A new heuristic algorithm for the operating room scheduling problem , 2011, Comput. Ind. Eng..