A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling

Abstract

In this paper, we study the patient planning and surgeon scheduling in the operating room theatre. The problem considers the simultaneous planning of patients and the assignment of time blocks to surgeons so that they can perform the surgery of their patients. The timing and length of the allotted time blocks depend on the patient characteristics on the surgeons’ waiting lists. Solving this problem in an exact manner is challenging due to the large number of rooms, surgeons, and patients involved. To overcome this challenge, we propose an efficient branch-price-and-cut algorithm to find an optimal solution in an acceptable time span. For that purpose, we include different dedicated mechanisms to accelerate the solution-finding process. In this regard, the branch-price-and-cut tree is set up using an intelligent branching scheme, the nodes are searched in order of the lowest number of fractional variables, and improved bounds are computed to prune nodes earlier. To tighten the convex hull of the linear programming relaxation in each node, the algorithm relies on a row generation mechanism for adding valid inequalities. We conducted various computational experiments to demonstrate the performance of our algorithm and validate for each component the contribution of the implemented optimisation principles. Additionally, we show the superior performance of the proposed algorithm to alternative optimisation procedures.