An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The ap- proximated method is examined together with its key parameters (freezing, tempering, cooling, number of contours to be explored), and the choices made in identifying these parameters are illustrated to generate a good algorithm that efficiently solves the scheduling problem.
|Titolo:||A Simulated Annealing Algorithm for Scheduling Problems|
GALLO, CRESCENZIO [Writing – Original Draft Preparation] (Corresponding)
CAPOZZI, VITO GIACOMO [Writing – Review & Editing]
|Data di pubblicazione:||2019|
|Appare nelle tipologie:||1.1 Articolo in rivista|