Abstract
The problem of scheduling surgeries consists of allocating patients and resources to each surgical stage, considering the patient’s needs, as well as sequencing and timing constraints. This problem is classified as NP-hard and has been widely discussed in the literature for the past 60 years. Nevertheless, many authors do not take into account the multiple stages and resources required to address the complex aspects of operating room management. The general goal of this paper is to propose a mathematical model to represent and solve this problem. Computational tests were also performed to compare the proposed model with a similar model from the literature, with a 64% average reduction in computational time.
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.
