A parallel ``Go with the winners algorithm for some scheduling problems

DOI10.33048/DAIO.2023.30.773MaRDI QIDQ6644075zbMATH OpenFDO

Authors Pavel Borisovsky

Publication date 27 November 2024

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2023.30.773

zbMATH Keywords

flow shop problemGPUmetaheuristicproduction scheduling

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel Processing and Applied Mathematics
• Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
• On single-walk parallelization of the job shop problem solving algorithms
• scientific article; zbMATH DE number 6006722
• Sequential and parallel computations in the general scheduling problem

Cites work

• A genetic algorithm for flowshop sequencing
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Evolutionary computation. 1. Basic algorithms and operators
• Evolutionary Multi-Criterion Optimization
• Some efficient heuristic methods for the flow shop sequencing problem
• Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues

Cited in

(1)

• On solving the robust transfer line balancing problem with parallel tasks and interval processing times

This page was built for publication: A parallel ``Go with the winners algorithm for some scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644075)