Parallel scatter search algorithm for the flow shop sequencing problem

Authors:
Wojciech Bożejko;Mieczysław Wodecki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland;Institute of Computer Science, Wrocław University of Technology, Wrocław, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 5
Cited 4

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
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
A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems

PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering

Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Journal of Parallel and Distributed Computing
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
Parallel Scatter Search Algorithms for Exam Timetabling

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper we consider strongly NP-hard flow shop problem with the criterion of minimization of the sum of job's finishing times. We present the parallel algorithm based on the scatter search method. Obtained results are compared to the best known from the literature. Superlinear speedup has been observed in the parallel calculations.