Design of parallel distributed algorithm for the Permutation Flow Shop Problem

This paper deals with the resolution of the Permutation Flow Shop Problem (PFSP) which requires scheduling n jobs through m machines that are placed in series so as to minimize the makespan. In this study, we focus on parallel methods for solving the one-machine PFSP. We present a parallel distribut...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 10th Annual International Conference on New Technologies of Distributed Systems (NOTERE) s. 65 - 72
Hlavní autori: Kouki, S, Jemni, M, Ladhari, T
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2010
Predmet:
Algorithm design and analysis
B&B algorithm
Distributed algorithms
parallel algorithms
Parallel computing
Permutation Flow Shop
Scheduling
ISBN:1424470676, 9781424470679
ISSN:2162-1896
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper deals with the resolution of the Permutation Flow Shop Problem (PFSP) which requires scheduling n jobs through m machines that are placed in series so as to minimize the makespan. In this study, we focus on parallel methods for solving the one-machine PFSP. We present a parallel distributed Algorithm for this problem with extensive computational results on cluster of computers using well-known benchmarks. The experimental evaluation of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.
ISBN:1424470676
9781424470679
ISSN:2162-1896
DOI:10.1109/NOTERE.2010.5536815