P2P B&B and GA for the flow-shop scheduling problem

Bendjoudi, Ahcène; Guerdah, Samir; Mansoura, Madjid; Melab, Nouredine; Talbi, El-Ghazali

Document type :

Partie d'ouvrage

DOI :

10.1007/978-3-540-69277-5_11

Title :

P2P B&B and GA for the flow-shop scheduling problem

Author(s) :

Bendjoudi, Ahcène [Auteur]
Centre de recherche sur l'Information Scientifique et Technique [CERIST]
Guerdah, Samir [Auteur]
Département de Mathématiques [Tizi Ouzou]
Mansoura, Madjid [Auteur]
Département de Mathématiques [Tizi Ouzou]
Melab, Nouredine [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]

Scientific editor(s) :

Springer

Book title :

Metaheuristics for Scheduling in Distributed Computing Environments

Publisher :

Springer

Publication date :

2008

HAL domain(s) :

Informatique [cs]/Autre [cs.OH]

English abstract : [en]

Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm (B&B) requires a huge amount of computational resources. The efficiency of such algorithm can be improved by its hybridization ...
Show more >Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm (B&B) requires a huge amount of computational resources. The efficiency of such algorithm can be improved by its hybridization with meta-heuristics such as Genetic Algorithms (GA) which proved their effectiveness, since they generate acceptable solutions in a reasonable time. Moreover, distributing at large scale the computation, using for instance Peer-to-Peer (P2P) Computing, provides an efficient way to reach high computing performance. In this chapter, we propose ParallelBB and ParallelGA, which are P2P-based parallelization of the B&B and GA algorithms for the computational Grid. The two algorithms have been implemented using the ProActive distributed object Grid middleware. The algorithms have been applied to a mono-criterion permutation flow-shop scheduling problem and promisingly experimented on the Grid5000 computational Grid.Show less >

Language :

Anglais

Audience :

Internationale

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

https://api.istex.fr/document/BBAEC76F82A67C0D88E1D0E9A164AF9CC9457842/fulltext/pdf?sid=hal
Open access
Access the document

https://api.istex.fr/document/BBAEC76F82A67C0D88E1D0E9A164AF9CC9457842/fulltext/pdf?sid=hal
Open access
Access the document

https://api.istex.fr/document/BBAEC76F82A67C0D88E1D0E9A164AF9CC9457842/fulltext/pdf?sid=hal
Open access
Access the document

https://api.istex.fr/document/BBAEC76F82A67C0D88E1D0E9A164AF9CC9457842/fulltext/pdf?sid=hal
Open access
Access the document

P2P B&B and GA for the flow-shop scheduling ... BibTeX CSV Excel RIS

Files

P2P B&B and GA for the flow-shop scheduling ...

BibTeX

CSV

Excel

RIS