Abstract
This project presents the development and application of an optimization model designed to allocate medical specialties to clinics based on a predefined schedule. By employing the Knapsack algorithm in Python, the model aims to optimize resource utilization within a medical environment, ensuring that the distribution of services is both efficient and effective. The model incorporates critical constraints such as clinic capacity and patient service demand, which are essential for balancing resources across various specialties. Furthermore, the model addresses potential scheduling conflicts, ensuring that no overlaps occur among different specialty professionals assigned to the same clinic. The integration of these constraints ensures that the allocation process is not only optimal but also practical for real-world implementation. The results demonstrate the potential of this approach to enhance operational efficiency, minimize resource wastage, and improve patient care by strategically managing the availability of specialized medical services across clinics. This model serves as a robust framework for healthcare organizations aiming to improve their resource management strategies.
Publisher
South Florida Publishing LLC
Reference11 articles.
1. Alexander, A. & M. Lemtyuzhnikova. (2022). Decomposition of the Knapsack Problem for Increasing the Capacity of Operating Rooms. Mathematics. https://doi.org10.3390/math10050784
2. Daryl, Santos. (2021). A Mathematical Model for In-Person Office Assignment During COVID-19. https://doi.org10.37266/ISER.2021V9I1.PP68-74
3. Tristan, Becker et al. (2019). Multi-Level Departments-to-Offices Assignment with Different Room Types. Computers & Operations Research. https://doi.org10.1016/J.COR.2019.05.015
4. Caserta, M., & Voß, S. (2015). An exact algorithm for the reliability redundancy allocation problem. European Journal of Operational Research, 244, 110-116. https://doi.org/10.1016/j.ejor.2014.11.021
5. Caserta, M., & Voß, S. (2019). The robust multiple-choice multidimensional knapsack problem. Omega, 86, 16-27. https://doi.org/10.1016/j.omega.2018.05.006