Fast parallel cost function calculation for the flow shop scheduling problem

Authors:
Wojciech Bożejko;Mariusz Uchroński;Mieczysław Wodecki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland and Wrocław Centre of Networking and Supercomputing, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 5
Cited 0

A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
Parallel Path-Relinking Method for the Flow Shop Scheduling Problem

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Parallel Calculating of the Goal Function in Metaheuristics Using GPU

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Parallel scatter search algorithm for the flow shop sequencing problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
On the theoretical properties of swap multimoves

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are proposing a methodology of the fast determination of the objective function for the flow shop scheduling problem in a parallel computing environment. Parallel Random Access Machine (PRAM) model is applied for the theoretical analysis of algorithm's efficiency. The presented method needs a fine-grained parallelization, therefore the proposed approach is especially devoted to parallel computing systems with fast shared memory, such as GPUs.