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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
