Mixed Integer Linear Programming Models for Scheduling Elective Surgical Procedures

Autor(es):Mostrar menos -

Hortencio, Hanna Pamplona ; Ronconi, Debora Pretti ; Gervasi, O ; Murgante, B ; Misra, S ; Garau, C ; Blecic, I ; Taniar, D ; Apduhan, BO ; Rocha, AMAC ; Tarantino, E ; Torre, CM ; Karaca, Y

• Tipo de documento: Artigo Científico
• Fonte: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2020, PT III; v. 12251, p. 16-pg., 2020-01-01.

Resumo

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. (AU)

• Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
• Beneficiário: Francisco Louzada Neto
• Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
• Processo FAPESP: 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos
• Beneficiário: Reinaldo Morabito Neto
• Modalidade de apoio: Auxílio à Pesquisa - Temático