Operating theatre scheduling using Lagrangian relaxation

V. Augusto, X. Xie and V. Perdomo

European Journal of Industrial Engineering, 2008, vol. 2, issue 2, 172-189

Abstract: This paper addresses the surgery operation scheduling problem. Three types of resources are considered: transporters, operating rooms and recovery beds. The patient is first transported from the ward to the operating theatre, is operated on in an operating room and then transferred immediately to a recovery bed before being transported back to the ward. The operating room needs to be cleaned after the surgery before starting another operation. The problem consists in assigning patients to transporters, operating rooms and recovery beds in order to minimise a criterion function of their completion times. The problem is NP-hard. A Lagrangian relaxation approach is proposed to determine a near-optimal schedule and a tight lower bound. Numerical results will be presented to show the efficiency of the method. [Received 31 January 2007; Revised 01 August 2007; Accepted 14 October 2007]

Keywords: Lagrangian relaxation; operating theatres; surgery scheduling; surgical operations; transporters; operating rooms; recovery beds; healthcare. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.inderscience.com/link.php?id=17350 (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:eujine:v:2:y:2008:i:2:p:172-189

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().