Cooperative Threads with Effective-Address in Simulated Annealing Algorithm to Job Shop Scheduling Problems

Abstract

This paper presents a parallel algorithm applied to the job shop scheduling problem (JSSP). The algorithm generates a set of threads, which work in parallel. Each generated thread, executes a procedure of simulated annealing which obtains one solution for the problem. Each solution is directed towards the best solution found by the system at the present, through a procedure called effective-address. The cooperative algorithm evaluates the makespan for various benchmarks of different sizes, small, medium, and large. A statistical analysis of the results of the algorithm is presented and a comparison of performance with other (sequential, parallel, and distributed processing) algorithms that are found in the literature is presented. The obtained results show that the cooperation of threads carried out by means of effective-address procedure permits to simulated annealing to work with increased efficacy and efficiency for problems of JSSP.

Metaheuristic to Optimize Computational Convergence in Convection-Diffusion and Driven-Cavity Problems

“…To reduce the time in which the optimized relaxation factors of the Driven-Cavity problem are obtained, work will be done to parallelize the SA algorithm using parallelization independent of SA, generating multiple executions of SA in parallel as applied in [24], or performing a parallelization of the metropolis cycle as applied in [25]. Either of the two parallelization techniques used will allow a reduction in SA execution time of over 80%, when using 10 central processing units for the execution of the SA algorithm designed to work in parallel.…”

Cooperative Path Planning for Aerial Recovery of a UAV Swarm Using Genetic Algorithm and Homotopic Approach

“…However, the solution quantity will increase exponentially in large-scale combinatorial optimization problems. To solve such problems efficiently, many heuristic algorithms have been studied, including the genetic algorithm (GA) [20][21][22], the ant colony algorithm [23,24], the simulated annealing algorithm [25][26][27], and the tabu search algorithm [28,29].…”

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model

“…Zhou et al [ 18 ] presented a hybrid social-spider optimization algorithm with a differential mutation (SSO-DM) operator to solve JSSP. Cruz-Chávez et al [ 19 ] proposed a parallel algorithm that generated a set of parallel working threads, where each thread performed a simulated annealing process to solve JSSP. For JSSP, Pongchairerks [ 20 ] proposed a new two-level meta-heuristic algorithm composed of an upper-level algorithm and a lower-level algorithm.…”