Operating room scheduling and rescheduling: a rolling horizon approach

详细信息    查看全文

• 作者：Bernardetta Addis ; Giuliana Carello…
• 关键词：Operating room planning and scheduling ; Rolling horizon ; Robust optimization ; Re ; scheduling
• 刊名：International Journal of Flexible Manufacturing Systems
• 出版年：2016
• 出版时间：June 2016
• 年：2016
• 卷：28
• 期：1-2
• 页码：206-232
• 全文大小：573 KB
• 参考文献：Adan I, Bekkers J, Dellaert N, Jeunet J, Vissers J (2011) Improving operational effectiveness of tactical master plans for emergency and elective patients under stochastic demand and capacitated resources. Eur J Oper Res 213:290–308CrossRef MathSciNet
  Addis B, Carello G, Tànfani E (2014a) A robust optimization approach for the operating room planning problem with uncertain surgery duration. In: Matta A, Li J, Sahin E, Lanzarone E, Fowler J et al (eds) Proceedings of the international conference on health care systems engineering, volume 61 of Springer proceedings in mathematics & statistics. Springer, New York, pp 175–189CrossRef
  Addis B, Carello G, Tànfani E (2014b) A robust optimization approach for the operating room planning problem with uncertain surgery duration: an extended analysis. HAL, Hyper Articles en ligne, FranceCrossRef
  Aringhieri R, Landa P, Soriano P, Tànfani E, Testi A (2015) A two level metaheuristic for the operating room scheduling and assignment problem. Comput Oper Res 54:21–34CrossRef MathSciNet
  Augusto V, Xie X, Perdomo V (2008) Operating theatre scheduling using lagrangian relaxation. Eur J Ind Eng 2(2):172–189CrossRef
  Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35–53CrossRef MathSciNet MATH
  Blake JT, Carter MW (1997) Surgical process scheduling: a structured review. J Soc Health Syst 5(3):17–30
  Cardoen B, Demeulemeester E, Beliën J (2009) Sequencing surgical cases in a day-care environment: an exact branch-and-price approach. Comput Oper Res 36(9):2660–2669CrossRef MATH
  Cardoen B, Demeulemeester E, Beliën J (2010a) Operating room planning and scheduling: a literature review. Eur J Oper Res 201:921–932CrossRef MATH
  Cardoen B, Demeulemeester E, Beliën J (2010b) Operating room planning and scheduling problems: a classification scheme. Int J Health Manag Inf 1(1):71–83
  Denton B, Viapiano J, Vogl A (2007) Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Manag Sci 10:13–24CrossRef
  Denton B, Miller J, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper Res 58:802–816CrossRef MathSciNet MATH
  Erdem E, Qu X, Shi J (2012) Rescheduling of elective patients upon the arrival of emergency patients. Decis Support Syst 54(1):551–563CrossRef
  Fei H, Chu C, Meskens N, Artiba A (2008) Solving surgical cases assignment problem by a branch-and-price approach. Int J Prod Econ 112:96–108CrossRef
  Guerriero F, Guido R (2011) Operational research in the management of the operating theatre: a survey. Health Care Manag Sci 14:89–114CrossRef
  Hans E, Wullink G, van Houdenhoven M, Kamezier G (2008) Robust surgery loading. Eur J Oper Res 185:1038–1050CrossRef MATH
  Herring WL, Herrmann JW (2011) Local search for the surgery admission planning problem. J Heuristics 17:389–414CrossRef
  Herring WL, Herrmann JW (2012) The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics. OR Spectr 34:429–459CrossRef MathSciNet MATH
  Magerlein JM, Martin JB (1978) Surgical demand scheduling: a review. Health Serv Res 13:418–433
  Marques I, Captivo ME, Pato MV (2012) An integer programming approach to elective surgery scheduling. OR Spectr 34:407–427CrossRef MathSciNet MATH
  Min D, Yih Y (2010) Scheduling elective surgery under uncertainty and downstream capacity constraints. Eur J Oper Res 206:642–652CrossRef MathSciNet MATH
  Pham DN, Klinkert A (2008) Surgical case scheduling as a generalized job shop scheduling problem. Eur J Oper Res 185:1011–1025CrossRef MathSciNet MATH
  Rizk C, Arnaout JP (2012) Aco for the surgical cases assignment problem. J Med Syst 36:1191–1199CrossRef
  Stuart K, Kozan E (2012) Reactive scheduling model for the operating theatres. Flex Serv Manuf J 24:400–421CrossRef
  Tànfani E, Testi A (2010) A pre-assignment heuristic algorithm for the master surgical schedule problem (mssp). Ann Oper Res 178(1):105–119CrossRef MathSciNet MATH
  Tànfani E, Testi A, Alvarez R (2010) Operating room planning considering stochastic surgery durations. Int J Health Manag Inf 1(2):167–183
  Testi A, Tànfani E, Torre GC (2007) A three-phase approach for operating theatre schedules. Health Care Manag Sci 10:163–172CrossRef
  Tyler DC, Pasquariello CA, Chen CH (2003) Determining optimum operating room utilization. Anesth Analg 96(4):1114–1121CrossRef
  Valente R, Testi A, Tànfani E, Fato M, Porro I, Santo M, Santori G, Torre GC, Ansaldo GL (2009) A model to prioritize access to elective surgery on the base of clinical urgency and waiting time. BMC Health Serv Res Ann Oper Res 9(1):1CrossRef
  Van Essen TJ, Hurink JL, Hartholt W, Akker BJ (2012) Decision support system for the operating room rescheduling problem. Health Care Manag Sci 15(4):355–372CrossRef
  van Oostrum JM, van Houdenhoven M, Hurink JL, Hans EW, Wullink G, Kazemier G (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectr 30:355–374CrossRef MATH
  van Oostrum JM, Bredenhoff E, Hans EW (2010) Suitability and managerial implications of a master surgical scheduling approach. Ann Oper Res 178(1):91–104CrossRef MathSciNet
  
• 作者单位：Bernardetta Addis (1)
  Giuliana Carello (2)
  Andrea Grosso (3)
  Elena Tànfani (4)
  
  1. LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est, 615 rue du Jardin Botanique, Vandœuvre lès Nancy, France
  2. Dipartimento di Elettronica, Informatica e Bioingegneria, Politecnico di Milano, via Ponzio 34, Milan, Italy
  3. Dipartimento di Informatica, Università di Torino, corso Svizzera 185, Turin, Italy
  4. Dipartimento di Economia, Università di Genova, via Vivaldi 5, Genoa, Italy
  
• 刊物类别：Engineering
• 出版者：Springer New York
• ISSN：1936-6590

文摘

In this work we consider the problem of selecting a set of patients among a given waiting list of elective patients and assigning them to a set of available operating room blocks. We assume a block scheduling strategy in which the number and the length of available blocks are given. As each block is related to a specific day, by assigning a patient to a block his/her surgery date is fixed, as well. Each patient is characterized by a recommended maximum waiting time and an uncertain surgery duration. In practical applications, new patients enter the waiting list continuously. Patient selection and assignment is performed by surgery departments on a short-term, usually a week, regular base. We propose a so-called rolling horizon approach for the patient selection and assignment. At each iteration short-term patient assignment is decided. However, in a look-ahead perspective, a longer planning horizon is considered when looking for the patient selection. The mid-term assignment over the next \(n\) weeks is generated by solving an ILP problem, minimizing a penalty function based on total waiting time and tardiness of patients. The approach is iteratively applied by shifting ahead the mid-term planning horizon. When applying the first week solution, unpredictable extensions of surgeries may disrupt the schedule. Such disruptions are recovered in the next iteration: the mid-term solution is rescheduled limiting the number of variations from the previously computed plan. Besides, the approach allows to deal with new patient arrivals. To keep limited the number of disruptions due to uncertain surgery duration, we propose also a robust formulation of the ILP problem. The deterministic and the robust formulation based frameworks are compared over a set of instances, including different stochastic realization of surgery times. Keywords Operating room planning and scheduling Rolling horizon Robust optimization Re-scheduling