A Parallel “Go with the Winners” Algorithm for Some Scheduling Problems

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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied and industrial mathematics Vol. 17; no. 4; pp. 687 - 697
Main Author:	Borisovsky, P. A.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01-09-2023 Springer Nature B.V
Subjects:	Evolutionary algorithms Genetic algorithms Graphics processing units Mathematics Mathematics and Statistics Permutations Production scheduling Flow Shop problem metaheuristic production scheduling GPU
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1990-4789 1990-4797
DOI:	10.1134/S1990478923040014