 |
|
|
|
| HAL : hal-00540266, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Computers & Industrial Engineering / Computers and Industrial Engineering 60, 2 (2011) pp. 320-327 |
|
|
|
|
| Solving Two-Stage Hybrid Flow Shop Using Climbing Depth-bounded Discrepancy Search |
|
|
| Abir Ben Hmida 1, 2Mohamed Haouari 2 |
|
|
| (03/2011) |
|
|
|
| This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson's rule and on dedicated lower bounds for the two-stage hybrid flow shop problem. We report the results of extensive computational experiments, which show that the proposed adaptation of the CDDS method solves instances in restrained CPU time and with high quality of makespan. |
|
|
|
|
|
|
|
|
|
|
|
| 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 : | Unité Recherche Opérationnelle pour l'Industrie (ROI) |
|
|
|
Ecole Polytechnique de Tunisie |
|
|
|
|
|
|
|
|
|
| MOGISA |
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle |
|
|
| Scheduling – Two-stage Hybrid Flow Shop – Discrepancy Search Methods – CDDS – Lower Bounds – Heuristics. |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00540266, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00540266 | |
| oai:hal.archives-ouvertes.fr:hal-00540266 | |
| Contributeur : Pierre Lopez | |
| Soumis le : Vendredi 26 Novembre 2010, 11:59:54 | |
| Dernière modification le : Lundi 24 Janvier 2011, 16:13:13 | |
