Heuristics for the Operating Theatre Planning and Scheduling

In this paper, we present a two-stage approach for planning and scheduling of operating theatres. The first stage concerns the operating theatre planning problem with the objectiveof minimizing number of days required to assign all surgical cases and number of days wasted for failure to meet surgica...

Full description

Saved in:
Bibliographic Details
Published in:Journal of decision systems 2010-01, Vol.19 (2), p.225-252
Main Authors: Souki, Mejdi, Rebai, Abdelwaheb
Format: Article
Language:English
Subjects:
algorithme génétique
Applied sciences
Biological and medical sciences
bloc opératoire
Exact sciences and technology
Genetic Algorithm
Genetic algorithms
Heuristic
Hospitalization
Hospitals
Integer programming
Iterated Local Search
Linear programming
Linens
Mathematical programming
Medical sciences
Operating theatre
Operational research and scientific management
Operational research. Management science
Patients
Queuing theory. Traffic theory
recherche à voisinage variable
Recovery (Medical)
Scheduling
Scheduling, sequencing
Studies
Surgeons
Surgery
Surgery (general aspects). Transplantations, organ and tissue grafts. Graft diseases
Variable Neighborhood Search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a two-stage approach for planning and scheduling of operating theatres. The first stage concerns the operating theatre planning problem with the objectiveof minimizing number of days required to assign all surgical cases and number of days wasted for failure to meet surgical cases deadlines. The second stage refers to the operating theatre scheduling problem with the objective of minimizing total tardiness of surgical cases and total waiting time of surgeons in operating rooms. For each problem investigated, a mathematical formulation using a mixed integer programming has been suggested. And to solve the foregoing problems, we propose firstly a set of dispatching rulebased heuristics and secondly three metaheuristics. Finally, computational experiments are presented to compare the performances of these heuristics.
ISSN:1246-0125
2116-7052
DOI:10.3166/jds.19.225-252