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ženo v:
Podrobná bibliografie
Vydáno v:2010 10th Annual International Conference on New Technologies of Distributed Systems (NOTERE) s. 65 - 72
Hlavní autoři: Kouki, S, Jemni, M, Ladhari, T
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2010
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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