 |
|
|
|
| HAL : hal-00491986, version 1 |
| DOI : 10.1016/j.engappai.2010.07.008 |
| Fiche détaillée |  Récupérer au format |
|
|
| Engineering Applications of Artificial Intelligence 24, 2 (2010) 220-231 |
|
|
|
|
| Generalized disjunctive constraint propagation for solving the job shop problem with time lags |
|
|
| Christian Artigues 1Marie-José Huguet 1 |
|
|
| (2010) |
|
|
|
| In this paper we propose new insights based on an insertion heuristic and generalized resource constraint propagation for solving the job shop scheduling problem with minimum and maximum time-lags. To show the contribution of our propositions we propose a branch-and-bound algorithm and provide an experimental study. The results obtained conclude that our heuristic obtains feasible schedules with a better makespan than previous approaches, especially for instances with tightened time lags. The results also prove the interest of the constraint propagation generalization when time lags are considered. |
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|
|
|
|
|
|
|
|
|
| MOGISA |
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00491986, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00491986 | |
| oai:hal.archives-ouvertes.fr:hal-00491986 | |
| Contributeur : Christian Artigues | |
| Soumis le : Lundi 14 Juin 2010, 17:19:51 | |
| Dernière modification le : Samedi 29 Janvier 2011, 21:18:47 | |
