Sequencing surgical cases in a day-care environment: An exact branch-and-price approach

Authors:
Brecht Cardoen;Erik Demeulemeester;Jeroen Beliën
Affiliations:
Faculty of Business and Economics, Department of Decision Sciences and Information Management, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium;Faculty of Business and Economics, Department of Decision Sciences and Information Management, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium;Faculty of Business and Economics, Department of Decision Sciences and Information Management, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium and Campus Economische Hogesc ...
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 8

The algorithm design manual

The algorithm design manual
A Hierarchical Multiple Criteria Mathematical Programming Approach for Scheduling General Surgery Operations in Large Hospitals

Journal of Medical Systems
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Mount Sinai Hospital Uses Integer Programming to Allocate Operating Room Time

Interfaces
Dynamic Programming

Dynamic Programming
Visualizing the Demand for Various Resources as a Function of the Master Surgery Schedule: A Case Study

Journal of Medical Systems

Strategic Enterprise Resource Planning in a Health-Care System Using a Multicriteria Decision-Making Model

Journal of Medical Systems
Local search for the surgery admission planning problem

Journal of Heuristics
The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics

OR Spectrum
An integer programming approach to elective surgery scheduling

OR Spectrum
Multi-objective scheduling and a resource allocation problem in hospitals

Journal of Scheduling
Rescheduling of elective patients upon the arrival of emergency patients

Decision Support Systems
Multi-objective operating room scheduling considering desiderata of the surgical team

Decision Support Systems
Tactical fixed job scheduling with spread-time constraints

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we investigate how to sequence surgical cases in a day-care facility. We specify a multi-criteria objective function in which we minimize the peak use of recovery beds, the occurrence of recovery overtime and the violation of various patient and surgeon preferences. The limited availability of resources and the occurrence of medical precautions, such as an additional cleaning of the operating room after the surgery of an infected patient, are taken into account. We apply column generation to solve this combinatorial optimization problem and propose a dynamic programming algorithm to solve the pricing problem. The computational efficiency of this dynamic programming approach is validated through comparison with a mixed integer linear programming approach. In order to obtain integer variables, we embed the column generation loop in an enumerative branch-and-price framework. We elaborate on various branching strategies and branching schemes and examine their impact on the solution quality. The test instances for the computational experiments are generated using real-life data of the surgical day-care center at the academic hospital UZ Leuven Campus Gasthuisberg (Belgium).