A tabu search heuristic approach for allocating operating room capacity

Majid M. Aldaihani

International Journal of Operational Research, 2014, vol. 21, issue 3, 279-292

Abstract: 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.

Keywords: linear programming; tabu search; surgery; operating room capacity; block time scheduling; operating theatres; healthcare management; hospitals; greedy search; resource allocation. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=65409 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:21:y:2014:i:3:p:279-292

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().