Operating theatre scheduling using Lagrangian relaxation

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.
Type de document :
Article dans une revue
European Journal of Industrial Engineering, Inderscience, 2008, 2 (2), pp.172-189. 〈10.1504/EJIE.2008.017350〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00449286
Contributeur : Andrée-Aimée Toucas <>
Soumis le : jeudi 21 janvier 2010 - 10:51:35
Dernière modification le : mercredi 29 novembre 2017 - 10:08:25

Identifiants

Citation

Vincent Augusto, Xiaolan Xie, Viviana Perdomo. Operating theatre scheduling using Lagrangian relaxation. European Journal of Industrial Engineering, Inderscience, 2008, 2 (2), pp.172-189. 〈10.1504/EJIE.2008.017350〉. 〈emse-00449286〉

Partager

Métriques

Consultations de la notice

101