 |
|
|
|
| HAL : hal-00279752, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| PMS 2008, Istanbul : Turkey (2008) |
|
|
|
|
| Discrepancy and backjumping heuristics for flexible job shop scheduling |
|
|
| Abir Ben Hmida 1, 2Mohamed Haouari 2 |
|
|
| (04/2008) |
|
|
|
| This paper presents an improved discrepancy-based method, called CDDS, after being adapted to solve the flexible job shop problem in a precedent work. We propose applying discrepancy on some pertinent variables chosen by using two types of heuristics. The method is tested on different problem instances from literature. |
|
|
|
|
|
|
|
|
|
|
|
| 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 – job shop – discrepancy – makespan |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00279752, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00279752 | |
| oai:hal.archives-ouvertes.fr:hal-00279752 | |
| Contributeur : Pierre Lopez | |
| Soumis le : Jeudi 15 Mai 2008, 11:43:11 | |
| Dernière modification le : Lundi 19 Mai 2008, 09:56:11 | |
