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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia in its series Quaderni DSEMS with number
16-2004.