Article ID: | iaor2005727 |
Country: | United Kingdom |
Volume: | 31 |
Issue: | 14 |
Start Page Number: | 2439 |
End Page Number: | 2451 |
Publication Date: | Dec 2004 |
Journal: | Computers and Operations Research |
Authors: | Zolfaghari Saeed, Azizi Nader |
Keywords: | heuristics |
In this paper, two variations of simulated annealing method have been proposed and tested on the minimum makespan job shop scheduling problems. In the conventional simulated annealing, the temperature declines constantly, providing the search with a higher transition probability in the beginning of the search and lower probability toward the end of the search. In the first proposed method, an adaptive temperature control scheme is used that changes temperature based on the number of consecutive improving moves. In the second method, a tabu list has been added to the adaptive simulated annealing algorithm in order to avoid revisits. The performance of these two algorithms is evaluated and favorably compared with the conventional simulated annealing.