In this work, we deal with a dynamic problem arising from outpatient healthcare facility systems. Patients in need of service arrive during the day at the facility. Their requests are expected to be satisfied within a given target time, otherwise, tardiness is incurred. The facility has multiple identical servers that operate simultaneously and are in charge of providing the patients with the requested services. Each server can provide only a finite subset of services, and each subset is called a configuration. The objective is to assign to each server a configuration selected from a set of predefined configurations, aiming at minimizing total tardiness. Assignments are not fixed statically, but they can be dynamically changed over time to better cope with the requested services. As the problem nature is dynamic, we propose a re-optimization algorithm that periodically optimizes the assignments with a Reduced Variable Neighborhood Search (RVNS). The RVNS works on neighborhood structures based on changing the assignments of one or more servers. The RVNS has been extensively tested on realistic instances. The results prove its efficiency in reaching low-tardiness solutions under low computing time.
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS / de Queiroz, T. A.; Bolsi, B.; de Lima, V. L.; Iori, M.; Kramer, A.. - 13863:(2023), pp. 97-111. (Intervento presentato al convegno 9th International Conference on Variable Neighborhood Search, ICVNS 2023 tenutosi a are nel 2022) [10.1007/978-3-031-34500-5_8].
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS
Bolsi B.;Iori M.;
2023
Abstract
In this work, we deal with a dynamic problem arising from outpatient healthcare facility systems. Patients in need of service arrive during the day at the facility. Their requests are expected to be satisfied within a given target time, otherwise, tardiness is incurred. The facility has multiple identical servers that operate simultaneously and are in charge of providing the patients with the requested services. Each server can provide only a finite subset of services, and each subset is called a configuration. The objective is to assign to each server a configuration selected from a set of predefined configurations, aiming at minimizing total tardiness. Assignments are not fixed statically, but they can be dynamically changed over time to better cope with the requested services. As the problem nature is dynamic, we propose a re-optimization algorithm that periodically optimizes the assignments with a Reduced Variable Neighborhood Search (RVNS). The RVNS works on neighborhood structures based on changing the assignments of one or more servers. The RVNS has been extensively tested on realistic instances. The results prove its efficiency in reaching low-tardiness solutions under low computing time.Pubblicazioni consigliate
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