Models and methods to solve the patient bed assignment problem and the operation room scheduling problem

• Grant number: 21/09482-4
• Support Opportunities: Scholarships in Brazil - Post-Doctoral
• Effective date (Start): November 01, 2021
• Effective date (End): October 31, 2023
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Antônio Augusto Chaves
• Grantee: Bruno Salezze Vieira
• Host Institution: Instituto de Ciência e Tecnologia (ICT). Universidade Federal de São Paulo (UNIFESP). Campus São José dos Campos. São José dos Campos , SP, Brazil
• Associated research grant: 18/15417-8 - Development of a hybrid metaheuristic with adaptive control flow and parameters, AP.JP2

Abstract

Hospital management is a hard task that requires solving different optimization problems. Among these problems we can cite the Patient Bed Assignment Problem (PBAP) and the Operating Room Scheduling Problem (ORSP). The PBAP consists of managing, in the best possible way, a set of beds with particular characteristics and assigning to them a set of patients with special requirements. The ORSP consists of creating a schedule that specifies which operating teams should be allocated to each operating room over the planning horizon. These problems are classified in the class of NP-hard problems. In this project, we are interested in investigating practical variants of these problems, mainly that consider preferences/priorities of patients. We hope to investigate new exact and heuristics algorithms, mainly the adaptive method Biased Random-Key Genetic Algorithm (BRKGA) combined with Machine Learning techniques. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

VIEIRA, BRUNO SALEZZE; RIBEIRO, GLAYDSTON MATTOS; BAHIENSE, LAURA. Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem. Computers & Operations Research, v. 153, p. 22-pg., 2023-02-20. (21/09482-4)