Issues related to the resolution of scheduling problems tend to be best faced with the approximation approach given by “simulated annealing”. This is a method which, in analogy to the physical systems’ behaviour during their cooling process, together with its main variables (freezing, temperature, cooling, neighbourhoods) well models the environment and the choices made in the definition of a good algorithm that efficiently solves the scheduling problem.
Solving scheduling problems with a simulated-annealing algorithm
GALLO, CRESCENZIO
2005-01-01
Abstract
Issues related to the resolution of scheduling problems tend to be best faced with the approximation approach given by “simulated annealing”. This is a method which, in analogy to the physical systems’ behaviour during their cooling process, together with its main variables (freezing, temperature, cooling, neighbourhoods) well models the environment and the choices made in the definition of a good algorithm that efficiently solves the scheduling problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
