Graph colouring approaches for a satellite range scheduling problem
N Zufferey, P Amstutz, P Giaccari - Journal of Scheduling, 2008 - Springer
A goal of this paper is to efficiently adapt the best ingredients of the graph colouring
techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose …
techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose …
[HTML][HTML] AFSCN scheduling: How the problem and solution have evolved
The Air Force Satellite Control Network (AFSCN) coordinates communications to more than
100 satellites via nine ground stations positioned around the globe. Customers request an …
100 satellites via nine ground stations positioned around the globe. Customers request an …
Genetic algorithms for satellite scheduling problems
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 …
problem, in a variety of formulations, arises in management of satellite/space missions …
Reviews and prospects in satellite range scheduling problem
S Li, Q Yu, H Ding - Autonomous Intelligent Systems, 2023 - Springer
With the increasing number of space satellites, the demand for satellite communication
(including maneuvering, command uploading and data downloading) has also grown …
(including maneuvering, command uploading and data downloading) has also grown …
Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
Ground station scheduling problem arises in spacecraft operations and aims to allocate
ground stations to spacecraft to make possible the communication between operations …
ground stations to spacecraft to make possible the communication between operations …
Understanding algorithm performance on an oversubscribed scheduling application
The best performing algorithms for a particular oversubscribed scheduling application, Air
Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet …
Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet …
[PDF][PDF] Leap before you look: An effective strategy in an oversubscribed scheduling problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when
enough resources are not available. For a particular oversubscribed problem, Air Force …
enough resources are not available. For a particular oversubscribed problem, Air Force …
[图书][B] Robust resource allocation in heterogeneous parallel and distributed computing systems
JT Smith II - 2008 - search.proquest.com
In a heterogeneous distributed computing environment, it is often advantageous to allocate
system resources in a manner that optimizes a given system performance measure …
system resources in a manner that optimizes a given system performance measure …
A simulated annealing algorithm for ground station scheduling problem
Among different versions of Satellite Scheduling, there is the Ground Station Scheduling,
whose aim is mission allocation of ground stations to spacecrafts. This scheduling problem …
whose aim is mission allocation of ground stations to spacecrafts. This scheduling problem …
Satellite mission scheduling based on genetic algorithm
B Sun, W Wang, X Xie, Q Qin - Kybernetes, 2010 - emerald.com
Purpose–The purpose of this paper is to describe a new satellite mission scheduling (SMS)
problem based on an genetic algorithm (GA). Design/methodology/approach–The SMS …
problem based on an genetic algorithm (GA). Design/methodology/approach–The SMS …