118documents trouvés
Greedy algorithms for time-frequency allocation in a SDMA satellite communication system
K.KIATMANAROJ, C.ARTIGUES, L.HOUSSIN, E.CORBEL
Thalès Alenia Space, MOGISA
Manifestation avec acte : International Conference on Modeling Optimization & SIMulation (MOSIM 2012), Bordeaux (France), 6-8 Juin 2012, 10p. , N° 12323
Diffusable
127565Hybrid discrete-continuous optimization for the frequency assignment problem in satellite communication system
K.KIATMANAROJ, C.ARTIGUES, L.HOUSSIN, F.MESSINE
MOGISA, IRIT-ENSEEIHT
Manifestation avec acte : IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2012), Bucarest (Roumanie), 23-25 Mai 2012, 6p. , N° 12194
Diffusable
127461The bi-objective multi-vehicle covering tour problem: formulation and lower bound
B.M.SARPONG, C.ARTIGUES, N.JOZEFOWIEZ
MOGISA
Manifestation avec acte : International Workshop on Freight Transportation and Logistics ( ODYSSEUS ) 2012 du 21 mai au 25 mai 2012, Mykonos (Grèce), 2012, 5p. , N° 12675
Diffusable
128731AMORES: an Architecture for MObiquitous REsilient Systems
C.ARTIGUES, Y.DESWARTE, J.GUIOCHET, M.J.HUGUET, M.O.KILLIJIAN, D.POWELL, M.ROY, C.BIDAN, N.PRIGENT, E.ANCEAUME, S.GAMBS, G.GUETTE, M.HURFIN, F.SCHETTINI
TSF, MOGISA, SUPELEC, IRISA, MobiGIS, Grenade
Manifestation avec acte : European Dependable Computing Conference (EDCC) 2012 du 08 mai au 11 mai 2012, Sibiu (Roumanie), Mai 2012, 6p. , N° 12642
Diffusable
128592Plans sur la comète !
G.SIMONIN, C.ARTIGUES, E.HEBRARD, P.LOPEZ
MOGISA
Manifestation sans acte : Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers (France), 11-13 Avril 2012, 2p. , N° 12173
Diffusable
126982A batch optimization solver for diffusion area scheduling in semiconductor manufacturing
C.YUGMA, C.ARTIGUES, S.DAUZERE-PERES, A.DERREUMAUX, O.SIBILLE
EMSE, MOGISA, ATMEL
Revue Scientifique : International Journal of Production Research, Vol.50, N°8, pp.2118-2132, Avril 2012 , N° 07134
Lien : http://hal.archives-ouvertes.fr/hal-00135012
Diffusable
Plus d'informations
Abstract
This paper presents a method and a software for solving a batching and scheduling problem in the diffusion area of a semiconductor plant, the ATMEL fabrication unit in Rousset, France. The diffusion area is one of the most complex area in the fab. A significant number of lots has to be processed while satisfying complex equipment process and line management constraints. The purpose of this study is to investigate approaches to group lots in batches, to assign the batches on the equipment and to sequence these batches. Three indicators are used to evaluate the quality of a solution: the total number of moves, the batching coefficient and the X-factor. The problem is modeled through the disjunctive graph formulation. A constructive algorithm is proposed and improvement procedures based on iterative sampling and simulated annealing are developed. Computational experiments, carried out on actual industrial problem instances, show the ability of iterative sampling to improve significantly the initial solution. The proposed simulated annealing method brings in turn important enhancements to the results of iterative sampling. The software based on these methods, named Batch Optimization Solver (BOS), is currently used in the diffusion area of ATMEL. The disjunctive graph model allows in addition a high level of interactivity with the decision makers.
Greedy algorithms for SDMA satellite communication system frequency allocation
C.ARTIGUES, L.HOUSSIN, F.MESSINE
IRIT-ENSEEIHT, MOGISA
Rapport de Contrat : Thales Alenia Space, INPT, LAAS-CNRS, Contrat n° 73688, Mars 2012, 41p. , N° 12092
Non diffusable
126730A railroad maintenance problem solved with a cut and column generation matheuristic
S.LANNEZ, C.ARTIGUES, J.DAMAY, M.GENDREAU
MOGISA, SNCF, CIRRELT
Rapport LAAS N°12016, Janvier 2012, 29p.
Lien : http://hal.archives-ouvertes.fr/hal-00659349
Diffusable
Plus d'informations
Abstract
In this paper we address a real life optimization problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling railway network inspection tasks. The objective is to minimize the total deadhead distance while performing all inspection tasks. Different 0-1 integer formulations for the problem are presented. A heuristic based on both Benders and Dantzig-Wolfe decompositions is proposed to solve this rich arc routing problem. Its performance is analyzed on a real life dataset provided by the French national railway company (SNCF). The proposed algorithm is compared to a dynamic programming-based heuristic. Its ability to schedule the inspection tasks of one year on a sparse graph with thousand nodes and arcs is assessed.
On electrical load tracking scheduling for a steel plant
A.HAIT, C.ARTIGUES
ISAE, MOGISA
Revue Scientifique : Computers & Chemical Engineering, Vol.35, N°12, pp.3044-3047, Décembre 2011 , N° 11082
Lien : http://hal.archives-ouvertes.fr/hal-00564746/fr/
Diffusable
Plus d'informations
Abstract
Nolde and Morari 2010 study a steel manufacturing scheduling problem where the tasks must be scheduled such that electricity consumption matches to a pre-specified periodic energy chart. They propose a continuous time integer linear programming formulation to solve the problem. In this note, we present an alternative continuous time formulation that improves significantly the computation time.
An hybrid CP/MILP method for scheduling with energy costs
A.HAIT, C.ARTIGUES
ISAE, MOGISA
Revue Scientifique : European Journal of Industrial Engineering, Vol.5, N°4, pp.471-489, Octobre 2011 , N° 10485
Lien : http://hal.archives-ouvertes.fr/hal-00492040/fr/
Diffusable
125504