Parallel Path-Relinking Method for the Flow Shop Scheduling Problem
ICCS '08 Proceedings of the 8th 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
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum
Computers and Industrial Engineering
| Hi-index | 0.00 |
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 interestingproperty is the fact that the speedup of parallel implementation is equal or even greater than p, where p is the number of processors.