A parallel “go with the winners” algorithm for some scheduling problems

A parallel “go with the winners” algorithm for some scheduling problems Full article

Journal

Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797

Output data

Year: 2023, Volume: 17, Number: 4, Pages: 687–697 Pages count : 11 DOI: 10.1134/S1990478923040014

Funding (1)

Russian Science Foundation

22-71-10015

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.

Borisovsky P.A.
A parallel “go with the winners” algorithm for some scheduling problems
Journal of Applied and Industrial Mathematics. 2023. V.17. N4. P.687–697. DOI: 10.1134/S1990478923040014 Scopus РИНЦ OpenAlex

Борисовский П.А.
Параллельный алгоритм «иди с победителями» для некоторых задач составления расписаний
Дискретный анализ и исследование операций. 2023. Т.30. №4. С.5–23. DOI: 10.33048/daio.2023.30.773 РИНЦ

Submitted:	May 12, 2023
Accepted:	Aug 20, 2023
Published print:	Sep 20, 2023
Published online:	Feb 16, 2024

Scopus:	2-s2.0-85185304033
Elibrary:	64504093
OpenAlex:	W4391909734

Пока нет цитирований