Local search for the surgery admission planning problem

Authors:
Atle Riise;Edmund K. Burke
Affiliations:
Department of Applied Mathematics, SINTEF ICT, Oslo, Norway 0314 and Centre of Mathematics for Applications, University of Oslo, Oslo, Norway 0316;School of Computer Science, University of Nottingham, Nottingham, UK NG8 1BB
Venue:
Journal of Heuristics
Year:
2011

Citing 8
Cited 0

Allocation of surgical procedures to operating rooms

Journal of Medical Systems
Allocation of Surgeries to Operating Rooms by Goal Programing

Journal of Medical Systems
A Hierarchical Multiple Criteria Mathematical Programming Approach for Scheduling General Surgery Operations in Large Hospitals

Journal of Medical Systems
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
The State of the Art of Nurse Rostering

Journal of Scheduling
A review of metrics on permutations for search landscape analysis

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

Computers and Operations Research
Physician scheduling in emergency rooms

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model for the surgery admission planning problem, and a meta-heuristic algorithm for solving it. The problem involves assigning operating rooms and dates to a set of elective surgeries, as well as scheduling the surgeries of each day and room. Simultaneously, a schedule is created for each surgeon to avoid double bookings. The presented algorithm uses simple Relocate and Two-Exchange neighbourhoods, governed by an iterated local search framework. The problem's search space associated with these move operators is analysed for three typical fitness surfaces, representing different compromises between patient waiting time, surgeon overtime, and waiting time for children in the morning on the day of surgery. The analysis shows that for the same problem instances, the different objectives give fitness surfaces with quite different characteristics. We present computational results for a set of benchmarks that are based on the admission planning problem in a chosen Norwegian hospital.