ORAHS2024
Abstract Submission

126. Rescheduling of Surgeries in an Online Setting

Contributed abstract in session TC-1: Poster session, stream Posters.

Tuesday, 14:00-15:30
Room: Auditorium

Authors (first author is the speaker)

1. Alexander Müller
OrgaCard Siemantel & Alt GmbH
2. Dominik Grimaldi
OrgaCard Siemantel & Alt GmbH
3. Alexander Martin
Liberal Arts and Sciences, University of Technology Nuremberg (UTN)
4. Lorenza Moreno
Computer Science, Federal University of Juiz de Fora
5. Sonja Weiland
University of Technology Nuremberg (UTN)

Abstract

A crucial task of ORs management is to coordinate the complex interplay between deviating durations of planned procedures, emergencies and changing resource availability. Thus, it is necessary to constantly make decisions during ongoing surgeries under time pressure and to take a variety of factors into account. With our optimization approach, we want to provide a decision support tool that assists in rescheduling surgical cases during live operation.
Our model is based on a Resource Constrained Project Scheduling Problem (RCPSP). It is adapted to the requirements of operating room scheduling, with consideration for the optimization goals of the specific environment in the real-time scheduling of surgical cases. To obtain solutions within a short time, we develop a branch-and-price algorithm in which the pricing problem is solved using a dynamic programming approach.
In branch-and-price algorithms, generating the columns is often one of the most time-consuming parts of the solution process. Therefore, the pricing problem, which is an (elementary) shortest path problem, is to be solved efficiently by cleverly excluding paths in the graph of the subproblem. To enable this exclusion of paths, approximations of both the primal and dual costs are used. In addition, it is investigated to what extent a better LP bound by applying cycle elimination in the pricing problem also reduces the effort for branching.

Keywords

Status: accepted

Back to the list of papers