Deux problèmes d'ordonnancement en télécommunications par satellite
RAIRO - Operations Research - Recherche Opérationnelle (1991)
- Volume: 25, Issue: 3, page 341-358
- ISSN: 0399-0559
Access Full Article
top
How to cite
topPrins, C.. "Deux problèmes d'ordonnancement en télécommunications par satellite." RAIRO - Operations Research - Recherche Opérationnelle 25.3 (1991): 341-358. <http://eudml.org/doc/105018>.
@article{Prins1991,
author = {Prins, C.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {resource constraints; list algorithm; NP-hard problems; satellite communications; scheduling data packets; simulated annealing; facility location},
language = {fre},
number = {3},
pages = {341-358},
publisher = {EDP-Sciences},
title = {Deux problèmes d'ordonnancement en télécommunications par satellite},
url = {http://eudml.org/doc/105018},
volume = {25},
year = {1991},
}
TY - JOUR
AU - Prins, C.
TI - Deux problèmes d'ordonnancement en télécommunications par satellite
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 3
SP - 341
EP - 358
LA - fre
KW - resource constraints; list algorithm; NP-hard problems; satellite communications; scheduling data packets; simulated annealing; facility location
UR - http://eudml.org/doc/105018
ER -
References
top- 1. C. PRINS, Problèmes d'optimisation de ressources dans les systèmes de télécommunications par satellite utilisant l'A.M.R.T., Doctorat de l'Université Paris-VI, juin 1988.
- 2. C. PRINS et J. CARLIER, Resource Optimization in a T.D.M.A./D.S.I. System: the EUTELSAT Approach, 7th Int. Conf. on Digital Satellite Communications (ICDSC-7)Munich, mai, 1986, p. 511-518.
- 3. J. CARLIER et C. PRINS, Optimisation des plans de trame dans le système A.M.R.T./C.N.C. d'EUTELSAT, Ann. Télécommun., 1988 43, n° 9-10.
- 4. M. R. GAREY et D. S. JOHNSON, Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979. Zbl0411.68039MR519066
- 5. S. KIRKPATRICK, C. D. GELATT et M.P. VECCHI, Optimization by Simulated Annealing, Science, 1983, 22, p. 671-680. Zbl1225.90162MR702485
- 6. D. S. JOHNSON, C. R. ARAGON, L. A. MCGEOCH et C. SCHEVON, Optimization by Simulated Annealing: an Experimental Evaluation, Oper. Res., 1989, 37, p. 865-892. Zbl0698.90065
- 7. R. L. GRAHAM, Bounds on Multiprocessing Time Anomalies, S.I.A.M. J. Appl. Math., 1969, 17, p. 416-429. Zbl0188.23101MR249214
- 8. M. R. GAREY et R. L. GRAHAM, Bounds for Multiprocessor Scheduling with Resource Constraints, S.I.A.M. J. on Comp., 1975, 4, p. 187-200. Zbl0333.68041MR378769
- 9. T. INUKAI, An Efficient SS/TDMA Time Slot Assignment Algorithm, I.E.E.E. Trans. Comm., 1979, 27, p. 1449-1455. MR547877
- 10. G. BONGIOVANNI, D. COPPERSMITH et C. K. WONG, An Optimum Time Slot Assignment Algorithm for a SS/TDMA System with Variable Number of Transponders, I.E.E.E. Trans. Comm., 1981, 29, p. 1025-1036. MR613237
- 11. C. A. KING, P. TRUSTY, J. JANKOWSKY, R. DUESING et P. ROACH, INTELSAT TDMA/DSI Burst Time Plan Development, Int. J. Satellite Comm., 1985, 3, p. 35-43.
- 12. M. MINOUX et C. BROUDER, Models and Algorithms for Optimal Traffic Assignment in SS/TDMA Switching Systems, Int. J. Satellite Comm., 1987, 5, p. 33-47.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.