A parallel ``Go with the winners'' algorithm for~some scheduling problems
Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 4, pp. 5-23

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider an approach to solving permutation scheduling problems using graphics accelerators. A parallel evolutionary algorithm based on the iterated random local search and the “Go with the winners” algorithm is proposed. A computational experiment was carried out on test instances of the classic Flow Shop problem and one applied production scheduling problem with time windows. The results show high computing speed and good accuracy of obtained solutions in comparison with various variants of the genetic algorithm and Gurobi solver. The proposed approach is easy to implement and convenient for adaptation to particular features of graphics computing and can be used to solve practical problems. Tab. 3, bibliogr. 18.
Keywords: Flow Shop problem, production scheduling, metaheuristic, GPU.
@article{DA_2023_30_4_a0,
     author = {P. A. Borisovsky},
     title = {A parallel {``Go} with the winners'' algorithm for~some scheduling problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--23},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2023_30_4_a0/}
}
TY  - JOUR
AU  - P. A. Borisovsky
TI  - A parallel ``Go with the winners'' algorithm for~some scheduling problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2023
SP  - 5
EP  - 23
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2023_30_4_a0/
LA  - ru
ID  - DA_2023_30_4_a0
ER  - 
%0 Journal Article
%A P. A. Borisovsky
%T A parallel ``Go with the winners'' algorithm for~some scheduling problems
%J Diskretnyj analiz i issledovanie operacij
%D 2023
%P 5-23
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2023_30_4_a0/
%G ru
%F DA_2023_30_4_a0
P. A. Borisovsky. A parallel ``Go with the winners'' algorithm for~some scheduling problems. Diskretnyj analiz i issledovanie operacij, Tome 30 (2023) no. 4, pp. 5-23. http://geodesic.mathdoc.fr/item/DA_2023_30_4_a0/