UN ALGORITMO DI SIMULATED ANNEALING PER LA SOLUZIONE DI UN PROBLEMA DI SCHEDULING

Abstract

An algorithm of "Simulated Annealing" for solving scheduling problems is presented. The issues related to scheduling are discussed, together with the Simulated Annealing approximation method and its main parameters (freezing, temperature, cooling, number of neighbourhoods to explore), the choices made in defining them for the generation of a good algorithm that efficiently resolves the scheduling problem.scheduling, simulated annealing.