91documents trouvés
Generalized disjunctive constraint propagation for solving the job shop problem with time lags
C.ARTIGUES, M.J.HUGUET, P.LOPEZ
MOGISA
Revue Scientifique : Engineering Applications of Artificial Intelligence, Vol.24, N°2, pp.220-231, Mars 2011 , N° 10373
Lien : http://hal.archives-ouvertes.fr/hal-00491986/fr/
Diffusable
123573Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
A.BEN HMIDA, M.HAOUARI, M.J.HUGUET, P.LOPEZ
La Marsa, MOGISA
Revue Scientifique : Computers and Industrial Engineering, Vol.60, N°2, pp.320-327, Mars 2011 , N° 10748
Lien : http://hal.archives-ouvertes.fr/hal-00540266/fr/
Diffusable
Plus d'informations
Abstract
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.
Label-setting algorithms for a polynomial bi-objective multimodal shortest path problem
F.GUEYE, C.ARTIGUES, M.J.HUGUET, F.SCHETTINI, L.DEZOU
MobiGIS, Grenade, MOGISA
Rapport LAAS N°11086, Février 2011, 26p.
Lien : http://hal.archives-ouvertes.fr/hal-00564447/fr/
Diffusable
Plus d'informations
Abstract
Taking into account the multimodality of urban transportation networks for computing the itinerary of an individual passenger introduces a number of additional constraints such as restriction and/or preferences in using some modes. In this paper, such constraints are gathered under the concept of viable path modeled by a deterministic nite state automaton. Several polynomial algorithms are proposed to solve a bi-objective problem where the goal is to find all the nondominated viable shortest paths under the two objectives travel time and number of modal transfers. Among these algorithms, we consider an improved variant of the topological label-setting algorithm provided by Lozano and Storchi (2001), a new multilabel multi-queue algorithm and its bidirectional variant. The different algorithms are compared on a real network. The results show that, on the considered network, the proposed algorithms outperform the Lozano and Storchi (2001) algorithm, both for the time-independent and time-dependent case. Finally, A* acceleration techniques are discussed.
Discrepancy search for the flexible job shop scheduling problem
A.BEN HMIDA, M.HAOUARI, M.J.HUGUET, P.LOPEZ
MOGISA, La Marsa
Revue Scientifique : Computers & Operations Research, Vol.37, N°12, pp.2192-2201, Décembre 2010 , N° 10138
Lien : http://hal.archives-ouvertes.fr/hal-00461981/fr/
Diffusable
Plus d'informations
Abstract
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.
A bidirectional/multi-queue algorithm for the bi-objective multimodal viable shortest path problem
F.GUEYE, C.ARTIGUES, M.J.HUGUET, F.SCHETTINI, L.DEZOU
MOGISA, MobiGIS, Grenade
Rapport LAAS N°10483, Août 2010, 16p.
Lien : http://hal.archives-ouvertes.fr/hal-00491615/fr/
Diffusable
122258Aide à la décision en logistique des déchets: étude de la stabilité des tournées de collecte de déchets
M.J.HUGUET, C.ARTIGUES, F.BANIEL, T.VIDAL, A.LETOUZEY, B.GRABOT, L.ZARDO, F.PELLETIER, S.BENSTEAD, J.J.LAURENS, L.BASTIDA
MOGISA, ENIT Tarbes, LGP-ENIT, CAM, ADEME, Eco-Emballages
Rapport de Contrat : Projet Région APRTT n° 07005288, Août 2010, 58p. , N° 10474
Diffusion restreinte
122245Climbing discrepancy search for flowshop and jobshop scheduling with time-lags
W.KAROUI, M.J.HUGUET, P.LOPEZ, M.HAOUARI
MOGISA, La Marsa
Revue Scientifique : Electronic Notes in Discrete Mathematics, Vol.36, pp.821-828, Août 2010 , N° 10097
Diffusable
122133Generalized resource constraint propagation for job shop scheduling with time lags
P.LOPEZ, M.J.HUGUET, C.ARTIGUES
MOGISA
Manifestation sans acte : European Conference on Operational Research (EURO XXIV), Lisbonne (Portugal), 11-14 Juillet 2010, 1p. (Résumé) , N° 10466
Diffusable
122218Bi-objective multimodal time-dependent shortest viable path algorithms
F.GUEYE, C.ARTIGUES, M.J.HUGUET
MOGISA
Manifestation avec acte : Triennial Symposium on Transportation Analysis (TRISTAN VII), Tromso (Norvège), 20-25 Juin 2010, pp.322-325 , N° 10028
Diffusable
121821Méthode de recherche à divergence limitée pour les problèmes d'ordonnancement avec contraintes de délais
W.KAROUI, M.J.HUGUET, P.LOPEZ, M.HAOUARI
La Marsa, MOGISA
Manifestation avec acte : International Conference of Modeling and Simulation (MOSIM'10), Hammamet (Tunisie), 10-12 Mai 2010, 6p. , N° 10012
Diffusable
121416