Parallel Path-Relinking Method for the Flow Shop Scheduling Problem

Authors:
Wojciech Bożejko;Mieczysław Wodecki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Science, University of Wrocław, Wrocław, Poland 50-383
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 5
Cited 2

Solving the Flow Shop Problem by Parallel Simulated Annealing

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Solving the Flow Shop Problem by Parallel Tabu Search

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
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

Fast parallel cost function calculation for the flow shop scheduling problem

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Solving bi-objective flow shop problem with hybrid path relinking algorithm

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The matter of using scheduling algorithms in parallel computing environments is discussed in the paper. A parallel path-relinking approach based on scatter search metaheuristics is proposed for the flow shop problem with Cmaxand Csumcriteria. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.