Abstract
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 harp problem. A Lagrangian relaxation approach is proposed in this paper 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.
