| Full text | |
| Author(s): Show less - |
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
Total Authors: 13
|
| Document type: | Journal article |
| Source: | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2020, PT III; v. 12251, p. 16-pg., 2020-01-01. |
| Abstract | |
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) | |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |