 |
|
|
|
| HAL : hal-00574226, version 1 |
| arXiv : 1103.1516 |
| Fiche détaillée |  Récupérer au format |
|
|
| International Conference CPAIOR 2011, Berlin : Allemagne (2011) |
|
|
|
|
| Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks |
|
|
Asma Lahimer 1Pierre Lopez 1 |
|
|
| (05/2011) |
|
|
|
| This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems. We propose a new approach based on limited discrepancy search to solve the problem. Our method is tested with reference to a proposed lower bound as well as the best-known solutions in literature. Computational results show that the developed approach is efficient in particular for large-size problems. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'analyse et d'architecture des systèmes (LAAS) |
|
|
|
CNRS : UPR8001 – Université Paul Sabatier - Toulouse III – Institut National Polytechnique de Toulouse - INPT – Institut National des Sciences Appliquées de Toulouse |
|
|
| 2 : | INSAT |
|
|
|
Institut National des Sciences Appliquées et de Technologie |
|
|
|
|
|
|
|
|
|
| LAAS-MOGISA |
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle Informatique/Intelligence artificielle |
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00574226, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00574226 | |
| oai:hal.archives-ouvertes.fr:hal-00574226 | |
| Contributeur : Pierre Lopez | |
| Soumis le : Lundi 7 Mars 2011, 15:00:15 | |
| Dernière modification le : Mardi 7 Juin 2011, 15:20:32 | |
