Introduction to algorithms
Fast parallel heuristics for the job shop scheduling problem
Computers and Operations Research
Heterogeneous computing and parallel genetic algorithms
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem
IEEE Intelligent Systems
Parallel Metaheuristics: A New Class of Algorithms
Parallel Metaheuristics: A New Class of Algorithms
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum
Computers and Industrial Engineering
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform
Journal of Parallel and Distributed Computing
On single-walk parallelization of the job shop problem solving algorithms
Computers and Operations Research
A parallel distributed algorithm for the permutation flow shop scheduling problem
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Parallel cost function determination on GPU for the job shop scheduling problem
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Parallel tabu search algorithm for the hybrid flow shop problem
Computers and Industrial Engineering
| Hi-index | 0.00 |
The matter of using scheduling algorithms in parallel computing environments is discussed in this paper. There are proposed methods of parallelizing the criterion function calculations for a single solution and a group of concentrated solutions (local neighborhood) dedicated to being used in metaheuristic approaches. Also a parallel scatter-search metaheuristic is proposed as a multiple-thread approach. Computational experiments are done for the flow shop, the classic NP-hard problem of the combinatorial optimization.