A pattern based, robust approach to cyclic master surgery scheduling

Authors:
Carlo Mannino;Eivind J. Nilssen;Tomas Eric Nordlander
Affiliations:
Department of Computer and System Sciences, Sapienza University of Rome, Rome, Italy;Department of Applied Mathematics, SINTEF ICT, Oslo, Norway 0314;Department of Applied Mathematics, SINTEF ICT, Oslo, Norway 0314
Venue:
Journal of Scheduling
Year:
2012

Citing 6
Cited 0

Mount Sinai Hospital Uses Integer Programming to Allocate Operating Room Time

Interfaces
The Price of Robustness

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

Journal of Medical Systems
A decision support system for cyclic master surgery scheduling with multiple objectives

Journal of Scheduling
Fast Approaches to Improve the Robustness of a Railway Timetable

Transportation Science
Light Robustness

Robust and Online Large-Scale Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Master Surgery Scheduling problem consists of finding a suitable allocation of operating resources to surgical groups. A myriad of variants of the problem has been addressed in literature. Here we focus on two major variants, arising during a cooperation with Sykehuset Asker og Bærum HF, a large hospital in the city of Oslo. The first variant asks for balancing patient queue lengths among different specialties, whereas the second for minimizing resort to overtime. To cope with these problems we introduce a new mixed integer linear formulation and show its beneficial properties. Both problems require the estimation of demand levels. As such estimation is affected by uncertainty, we also develop a light robustness approach to the second variant. Finally we present computational results on a number of real-world instances provided by our reference hospital.