Parallel Computing in Electrical Engineering, 2004. International Conference on (2002)

Warsaw, Poland

Sept. 22, 2002 to Sept. 25, 2002

ISBN: 0-7695-1730-7

pp: 189

Wojciech Bożejko , Wroclaw University of Technology

Mieczysław Wodecki , University of Wrocław

ABSTRACT

In this paper we present a parallel tabu search algorithm for the permutation flow shop sequencing problem with the objective of minimizing the flowtime. We propose a neighbourhood using so-called blocks of jobs on a critical path and a backtrace jump method. By computer simulations it is shown that the performance of the proposed algorithm is comparable with the random heuristic technique discussed in literature. Another interesting property is the fact that the speedup of parallel implementation is equal or even greater than p, where p is the number of processors.

INDEX TERMS

null

CITATION

Wojciech Bożejko,
Mieczysław Wodecki,
"Solving the Flow Shop Problem by Parallel Tabu Search",

*Parallel Computing in Electrical Engineering, 2004. International Conference on*, vol. 00, no. , pp. 189, 2002, doi:10.1109/PCEE.2002.1115237