This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2024-193399
If you've NEVER registered a DOI in your Lattes, check our tutorial!This work proposes a mixed integer linear programming approach to the daily scheduling problem of surgeries in hospitals, aiming to minimize the number of unallocated surgeries, the number of rooms used, the quantity of rooms used by each surgeon, and the delay of surgeries that exceed the planned closing time, in addition to maximizing the utilization of room reservations. The problem was modeled to meet the specific needs of a hospital group, which provided data from two hospitals for model validation. The results demonstrate that the proposed model is effective in achieving the defined objectives, highlighting it as a tool that can bring significant benefits to the surgery scheduling process.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper