A constraint-based approach to satellite scheduling
DIMACS workshop on on Constraint programming and large scale discrete optimization
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
Data retrieval for location-dependent queries in a multi-cell wireless environment
Mobile Information Systems
Solving temporal over-constrained problems using fuzzy techniques
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Marco Somalvico Memorial Issue
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Continuous Range Search Query Processing in Mobile Navigation
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
MPLS traffic engineering for multimedia on satellite networks
Journal of Mobile Multimedia
Computers and Industrial Engineering
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
QoS routing in ad-hoc networks using GA and multi-objective optimization
Mobile Information Systems - Emerging Wireless and Mobile Technologies
Hi-index | 0.00 |
Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA European Space Agency and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.