A tabu search heuristic approach for allocating operating room capacity (Q2627532)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tabu search heuristic approach for allocating operating room capacity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search heuristic approach for allocating operating room capacity |
scientific article |
Statements
A tabu search heuristic approach for allocating operating room capacity (English)
0 references
31 May 2017
0 references
Summary: In this paper, two methodologies for allocating hospital operating room (OR) capacity to medical specialties were developed. The first methodology integrates a linear programming (LP) model with a tabu search (TS) heuristic algorithm and the second methodology integrates a greedy search algorithm (GA) with a TS heuristic algorithm. The models determine a monthly operating room allocating template that minimises inpatients' length of stay. A number of patient type priorities (e.g., emergency over inpatient) and clinical constraints (e.g., maximum number of hours allocated to each specialty) are included in the models. The proposed methodologies are tested using real data, analysed using various scenarios and compared in terms of solution quality and computational time.
0 references
linear programming
0 references
tabu search
0 references
surgery
0 references
operating room capacity
0 references
block time scheduling
0 references
operating theatres
0 references
healthcare management
0 references
hospitals
0 references
greedy search
0 references
resource allocation
0 references