To cite this paper use one of the standards below:
Computed Tomography Scheduling is an NP-hard variant of the Patient Appointment Scheduling Problem. This work proposes an architecture that integrates clinical text mining, via Natural Language Processing, to evolutionary optimization. Supported by real data (N = 52,018, 2019–2024), the comparison revealed that, while the annual segmentation of the exact model (MILP) raised the overall cost to Z = 1.74 × 108 , the continuous flow Genetic Algorithm (GA) eliminated clinical damage (Z ≈ 0). The model reduced the median waiting time for urgent cases from 42 to 1 day (p < 0.001), validating the Taguchi Loss Function in radiology. The results demonstrate that full care compliance is feasible without expanding physical resources. The success of the model lies in dynamic management and schedule compaction, which absorb seasonal peaks and align efficiency with Rawls' Maximin Principle.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper