By Topic

Operating Theatre Scheduling Using Lagrangian Relaxation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Perdomo, V. ; Ecole Nat. Superieure des Mines de Saint-Etienne ; Augusto, V. ; Xiaolan Xie

This paper addresses the surgery operation scheduling problem. Two types of resources are considered, operating rooms and recovery beds. Each patient first visits an operating room for surgery operation and is transferred to a recovery room immediately after the surgery operation. The operating room needs to be cleaned after the surgery operation before starting another operation. The problem consists in assigning patients to operating rooms and recovery beds in order to minimize the sum over all patients of one defined function of their completion times. According to this, the problem is NP hard problem. A Lagrangian relaxation approach is proposed in this paper to determine a near optimal schedule and a tight lower bound. Numerical results are presented to show the efficiency of the method

Published in:

Service Systems and Service Management, 2006 International Conference on  (Volume:2 )

Date of Conference:

25-27 Oct. 2006