19documents trouvés
Une procédure pour la résolution du problème de jobshop cyclique
T.BEN RAHHOU, M.FINK, L.HOUSSIN
MOGISA
Manifestation avec acte : Conférence Internationale Francophone d'Automatique (CIFA2012), Grenoble (France), 4-6 Juillet 2012, pp.913-918 , N° 11664
Diffusable
127627Frequency assignment in a SDMA satellite communication system with beam decentring feature
K.KIATMANAROJ, C.ARTIGUES, L.HOUSSIN, F.MESSINE
MOGISA, IRIT-ENSEEIHT
Rapport LAAS N°12284, Juin 2012, 17p.
Lien : http://hal.archives-ouvertes.fr/hal-00706037
Diffusable
Plus d'informations
Abstract
In satellite communication, Spatial DivisionMultiple Access (SDMA) has become one of the most promising techniques that can accommodate continuing increase in the number of users and traffic demands. The technology is based on radio resource sharing that separates communication channels in space. It relies on adaptive and dynamic beam-forming technology and well-designed algorithms for resource allocation among which frequency assignment is considered. This paper studies static Frequency Assignment Problem (FAP) in a satellite communication system involving a satellite and a number of users located in a service area. The objective is to maximize the number of users that the system can serve while maintaining the signal to interference plus noise ratio of each user under a predefined threshold. Traditionally, interference is treated as binary and fixed. In this paper, the interference is cumulative and variable. To solve the problem, we work on both discrete and continuous optimizations. Integer linear programming formulations and greedy algorithms are proposed for solving the discrete frequency assignment problem. The solution is further improved by beamdecentring algorithmwhich involves continuous adjustment of satellite beams and deals with non-linear change of interference.
Frequency allocation in a SDMA satellite communication system with beam moving
K.KIATMANAROJ, C.ARTIGUES, L.HOUSSIN, F.MESSINE
MOGISA, IRIT-ENSEEIHT
Manifestation avec acte : IEEE International Conference on Communications (ICC 2012), Ottawa (Canada), 10-15 Juin 2012, 5p. , N° 12324
Diffusable
127567Greedy 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
127565A new procedure for the cyclic job shop problem
M.FINK, T.BEN RAHHOU, L.HOUSSIN
MOGISA
Manifestation avec acte : IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2012), Bucarest (Roumanie), 23-25 Mai 2012, 6p. , N° 11662
Diffusable
127460Hybrid 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
127461Procédure de branch and bound pour le jobshop cyclique
T.BEN RAHHOU, L.HOUSSIN, M.FINK
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° 11663
Diffusable
126987Greedy 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
126730Frequency allocation problem in a SDMA satellite communication system
L.HOUSSIN, C.ARTIGUES, E.CORBEL
MOGISA, Thalès Alenia Space
Revue Scientifique : Computers & Industrial Engineering, Vol.61, N°2, pp.346-351, Septembre 2011, , N° 09752
Lien : http://hal.archives-ouvertes.fr/hal-00667946
Diffusable
Plus d'informations
Abstract
SDMA (Spatial Division Multiple Access) is a principle of radio resource sharing that relies on the division of the space dimension into separated communication channels. SDMA basically relies on adaptive and dynamic beam-forming associated to a clever algorithm in charge of resource allocation. As satellite communication systems move towards an increasing number of users and a larger throughput for each of them, SDMA is one of the most promising techniques that can reach these two goals. This paper studies static Frequency Assignment Problems (FAP) in a satellite communication system involving a gateway connected to a terrestrial network and some user terminals located in a service area. Two scenarios are considered: one based on SDMA and the other based on usual spot coverage. We propose original integer linear programming formulations and greedy allocation algorithms for the FAP which involves unusual cumulative interference constraints. By considering the link budget of each user, the objective is to maximize the number of users that the system can serve. We show through computational experiments on realistic data that the FAP associated with the SDMA system can be solved efficiently, yielding substantial improvement compared to the traditional system.
Cyclic jobshop problem and (max, plus) algebra
L.HOUSSIN
MOGISA
Manifestation avec acte : World IFAC Congress (IFAC 2011), Milan (Italie), 28 Août - 2 Septembre 2011, pp.2717-2721 , N° 11116
Lien : http://hal.archives-ouvertes.fr/hal-00667948
Diffusable
Plus d'informations
Abstract
In this paper, we focus on the cyclic job-shop problem. This problem consists in determining the order of a set of generic tasks on machines in order to minimize the cycle time of the sequence. We propose an exact method to solve this problem. For each solution, a linear max-plus model (possibly non causal) is obtained. To evaluate the performance of a considered schedule, we build the causal max-plus representation and compute the eigenvalue of the evolution matrix. A branch and bound procedure is presented.