Deux problèmes d'ordonnancement en télécommunications par satellite

DOI10.1051/RO/1991250303411MaRDI QIDQ3360657zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105018

zbMATH Keywords

simulated annealingfacility locationNP-hard problemsresource constraintssatellite communicationslist algorithmscheduling data packets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18)

Recommendations

• Scheduling space-ground communications for the air force satellite control network
• Scheduling space-ground communications for the air force satellite control network
• A note on scheduling problems arising in satellite communications
• A constraint-based approach to satellite scheduling
• AFSCN scheduling: how the problem and solution have evolved

Cited in

(19)

• Scheduling space-ground communications for the air force satellite control network
• AFSCN scheduling: how the problem and solution have evolved
• Tactical and strategic models for satellite customer assignment
• Metaheuristics: A bibliography
• Quasi-optimal resource allocation in multispot MFTDMA satellite networks
• Modeling the satellite placement problem as a network flow problem with one side constraint
• Graph colouring approaches for a satellite range scheduling problem
• On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
• Scheduling space-ground communications for the air force satellite control network
• Solving the swath segment selection problem through Lagrangean relaxation
• Optimal balancing of satellite queues in packet transmission to ground stations
• On the tractability of satellite range scheduling
• Designing satellite communication networks by zero—one quadratic programming
• New bounds for optimum traffic assignment in satellite communication.
• Constraint programming for planning test campaigns of communications satellites
• Planification à moyen terme de la production d'un satellite défilant et ensembles stables
• An Overview of Scheduling Problems Arising in Satellite Communications
• Minimum Spillage Sequencing

This page was built for publication: Deux problèmes d'ordonnancement en télécommunications par satellite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360657)