118documents trouvés
An on/off event-based formulation for RCPSP with production and consumption of resources
O.KONE, C.ARTIGUES, P.LOPEZ, M.MONGEAU
MOGISA, IMT, Toulouse
Manifestation avec acte : 12th International Workshop devoted to Project Management and Scheduling (PMS 2010), Tours (France), 26-28 Avril 2010, 4p. , N° 10011
Diffusable
121202An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
C.ARTIGUES, N.JOZEFOWIEZ, M.A.ALOULOU
MOGISA, LAMSADE
Manifestation avec acte : International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet (Tunisie), 24-26 Mars 2010, 8p. , N° 10484
Lien : http://hal.archives-ouvertes.fr/hal-00492202/fr/
Diffusable
122260Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
M.AYALA PEREZ, C.ARTIGUES, B.GACIAS
MOGISA
Manifestation avec acte : International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet (Tunisie), 24-26 Mars 2010, 8p. , N° 10220
Diffusable
121200Génération de colonnes pour l'ordonnancement modulo sous contraintes de ressources
M.AYALA PEREZ, C.ARTIGUES
MOGISA
Manifestation sans acte : ROADEF 2010, Toulouse (France), Février 2010, 2p. , N° 10222
Diffusable
121209Un nouvel algorithme pour le plus court chemin multimodal bi-objectif avec minimisation du temps de trajet et du nombre de transferts
F.GUEYE, C.ARTIGUES, M.J.HUGUET, F.SCHETTINI, L.DEZOU
MOGISA, MobiGIS, Grenade
Manifestation sans acte : ROADEF 2010, Toulouse (France), 24-26 Février 2010, 2p. , N° 10016
Diffusable
121018An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
R.ELIZONDO, V.PARADA, L.PRADENAS, C.ARTIGUES
Chili, CONCEPCION, MOGISA
Revue Scientifique : Journal of Heuristics, Vol.16, N°4, pp.575-591, 2010 , N° 09052
Lien : http://hal.archives-ouvertes.fr/hal-00364955/fr/
Diffusable
Plus d'informations
Abstract
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which belong to the np-hard class of problems. Therefore, their resolution in real situations is generally addressed using heuristic methods. This paper considers the duty generation problem, which consists of identifying an optimal trips set that the conductors should complete in a labor day. With regard to the operational and labor conditions, the trains should be driven with the lowest number of conductors and a minimized total idle time between trips. The problem is modeled and solved using a constructive hybrid approach, which has the advantage of visualizing a solution construction similar to the approach typically used by operators who manually solve the problem. This approach takes advantage of the benefits offered by evolutionary methods, which hardly store a candidate solutions population in each stage, controlling in this way the combinatorial explosion of possible solutions. The results that we obtained for problems with similar characteristics to those that are performed manually in the Santiago Metro System were compared with two alternative approaches based on tabu search and a greedy method. The hybrid method produced similar results to those generated by the tabu search, and both found better results than the greedy method.
Mots-Clés / Keywords
Graph search methods; Crew scheduling problem;
Ordonnancement cyclique : une approche par la théorie des tas
T.BEN RAHHOU, L.HOUSSIN, C.ARTIGUES
MOGISA
Manifestation sans acte : ROADEF 2010, Toulouse (France), Février 2010, 6p. , N° 09757
Diffusable
121321Propagation de contraintes généralisée pour la résolution du Job Shop avec "time lags" maximaux
M.J.HUGUET, C.ARTIGUES, M. DUGAS, P.LOPEZ
MOGISA
Manifestation sans acte : ROADEF 2010, Toulouse (France), 24-26 Février 2010, 2p. , N° 10021
Diffusable
121016Heap of pieces approach for the cyclic job-shop problem
L.HOUSSIN, T.BEN RAHHOU, C.ARTIGUES
MOGISA
Rapport LAAS N°09754, Décembre 2009
Diffusable
119864The resource-constrained activity insertion problem with minimum and maximum time lags
C.ARTIGUES, C.BRIAND
MOGISA
Revue Scientifique : Journal of Scheduling, Vol.12, N°5, pp.447-460, Septembre 2009 , N° 07678
Lien : http://hal.archives-ouvertes.fr/hal-00194384/fr/
Diffusable
Plus d'informations
Abstract
We define the resource-constrained activity insertion problem with minimum and maximum time lags. The problem aims at inserting a single activity in a partial schedule while preserving its structure represented through resource flow networks and minimizing the makespan increase caused by the insertion. We show that finding a feasible insertion position that minimizes the project duration is NP-hard in the general case. When only minimum time lags are considered and when activity durations are strictly positive, we show the problem is polynomially solvable, generalizing previously established results on activity insertion for the standard resource-constrained project scheduling problem.
Mots-Clés / Keywords
Resource-constrained project scheduling; Minimum and maximum time lags; Activity insertion problem; Complexity;