A Parallel Algorithm of Simulated Annealing for Multiprocessor Scheduling
Источник: Journal of Computer and Systems Sciences International, 2008, Vol. 47, No. 3, pp. 455–463. © Pleiades Publishing, Ltd., 2008
Аннотация: Algorithms of simulated annealing for solving problems of multiprocessor scheduling are considered, an approach to parallelization is proposed, and the results of comparisons between the classical sequential, sequential, and parallel algorithms of simulated annealing using a partition of the initial space of solutions into regions are presented.
Скачать pdf-файл материала