A Simulated Annealing Algorithm for Scheduling Problems

HTML  XML Download Download as PDF (Size: 464KB)  PP. 2579-2594  
DOI: 10.4236/jamp.2019.711176    1,028 Downloads   6,803 Views  Citations

ABSTRACT

An algorithm using the heuristic technique of Simulated Annealing to solve a scheduling problem is presented, focusing on the scheduling issues. The approximated 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.

Share and Cite:

Gallo, C. and Capozzi, V. (2019) A Simulated Annealing Algorithm for Scheduling Problems. Journal of Applied Mathematics and Physics, 7, 2579-2594. doi: 10.4236/jamp.2019.711176.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.