This work deals with a dynamic problem arising from an outpatient healthcare facility. Patients with varying priorities arrive throughout the day, each with specific service requests that must be satisfied within target times. Failure to meet these targets incurs weighted tardiness penalties. Additionally, patients may choose to leave the system if subjected to prolonged waiting times, leading to further weighted penalties. The outpatient facility is equipped with multiple identical servers, each capable of providing a finite subset of services, referred to as configurations. The objective is to dynamically assign configurations, selected from a predefined set, to servers by minimizing the sum of weighted tardiness and abandonment penalties. Assignments are not fixed statically but can be dynamically changed over time to cope with the service requests. To address this problem, we propose a Scenario-Based Planning and Recombination Approach (SBPRA) that integrates an inner Reduced Variable Neighborhood Search. Differently from the traditional Scenario-Based Planning Approach (SBPA), which makes decisions based only on the solutions of individual scenarios, our approach solves an optimization problem to produce an additional solution that offers the best balance among the scenario solutions. Extensive tests on realistic instances show that SBPRA generates solutions that are 38% on average more effective than those generated by SBPA. Overall, the proposed approach can optimize resource allocation, mitigate the impact of patient abandonment, and improve the performance of the outpatient healthcare facility.

Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach / Bolsi, B.; Alves de Queiroz, T.; de Lima, V. L.; Kramer, A.; Iori, M.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 169:(2024), pp. 1-15. [10.1016/j.cor.2024.106719]

Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach

Bolsi B.;Alves de Queiroz T.;Iori M.
2024

Abstract

This work deals with a dynamic problem arising from an outpatient healthcare facility. Patients with varying priorities arrive throughout the day, each with specific service requests that must be satisfied within target times. Failure to meet these targets incurs weighted tardiness penalties. Additionally, patients may choose to leave the system if subjected to prolonged waiting times, leading to further weighted penalties. The outpatient facility is equipped with multiple identical servers, each capable of providing a finite subset of services, referred to as configurations. The objective is to dynamically assign configurations, selected from a predefined set, to servers by minimizing the sum of weighted tardiness and abandonment penalties. Assignments are not fixed statically but can be dynamically changed over time to cope with the service requests. To address this problem, we propose a Scenario-Based Planning and Recombination Approach (SBPRA) that integrates an inner Reduced Variable Neighborhood Search. Differently from the traditional Scenario-Based Planning Approach (SBPA), which makes decisions based only on the solutions of individual scenarios, our approach solves an optimization problem to produce an additional solution that offers the best balance among the scenario solutions. Extensive tests on realistic instances show that SBPRA generates solutions that are 38% on average more effective than those generated by SBPA. Overall, the proposed approach can optimize resource allocation, mitigate the impact of patient abandonment, and improve the performance of the outpatient healthcare facility.
2024
4-giu-2024
169
1
15
Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach / Bolsi, B.; Alves de Queiroz, T.; de Lima, V. L.; Kramer, A.; Iori, M.. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 169:(2024), pp. 1-15. [10.1016/j.cor.2024.106719]
Bolsi, B.; Alves de Queiroz, T.; de Lima, V. L.; Kramer, A.; Iori, M.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1353112
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact