Advanced search
Start date
Betweenand

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

Grant number: 21/09482-4
Support type:Scholarships in Brazil - Post-Doctorate
Effective date (Start): November 01, 2021
Effective date (End): October 31, 2023
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal researcher:Antônio Augusto Chaves
Grantee:Bruno Salezze Vieira
Home 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)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.