Abstract
This paper describes an operating room planning problem in which patients have different severity levels when they are diagnosed, and patient health condition deteriorates with the increase of waiting time. In addition, uncertainty in surgery durations is incorporated in this problem. A stochastic mixed integer program is proposed to optimize the assignment of surgeries considering the worst patient health condition among all patients waiting for surgeries and total overtime that exceeds the available time durations allotted for surgeries. This paper presents three solution approaches: the sample average approximation method, a fastest ascent local search, and a tabu search. These three solution approaches are evaluated in the computational study and the results show that the tabu search provides effective solutions within reasonable computation times.
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.
