High-performance technique for satellite range scheduling

A high-performance technique for satellite range scheduling is developed.An approach to identifying irreconcilable conflicts and avoiding ineffective interchange operations is proposed.A new measurement of request flexibility is proposed.A new test generator for satellite range scheduling is developed.A concise programming model is presented. As the number of daily satellite service requests increases, the satellite range scheduling problem becomes more intractable during the ground station operations management. The NP-complete problem involves scheduling satellite requests to ground station antennas within their time windows so that the profit from the scheduled requests is maximized. This paper analyzes various conflicts between satellite requests and then develops a conflict-resolution technique. The technique first builds an elite initial schedule using a prescheduling strategy and then improves the initial schedule using a rescheduling strategy in a subspace of feasible solutions. The main highlight of the technique is its dual functions of quickly generating a high-quality solution and providing a good bound. As shown in the experimental results from the actual data and more difficult random instances, the proposed technique is significantly better than the best-known heuristic.

[1]  Djamal Habet,et al.  Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite , 2010, Comput. Optim. Appl..

[2]  William J. Wolfe,et al.  Three Scheduling Algorithms Applied to the Earth Observing Systems Domain , 2000 .

[3]  Donald A. Parish.  A Genetic Algorithm Approach to Automating Satellite Range Scheduling , 1994 .

[4]  Thierry Benoist,et al.  Upper bounds for revenue maximization in a satellite scheduling problem , 2004, 4OR.

[5]  L. Darrell Whitley,et al.  AFSCN scheduling: How the problem and solution have evolved , 2006, Math. Comput. Model..

[6]  J. T. Moore,et al.  Automating Air Force Satellite control Network (AFSCN) scheduling , 1996 .

[7]  L. Darrell Whitley,et al.  Scheduling Space–Ground Communications for the Air Force Satellite Control Network , 2004, J. Sched..

[8]  Nicolas Zufferey,et al.  Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..

[9]  Fabrizio Marinelli,et al.  A Lagrangian heuristic for satellite range scheduling with resource constraints , 2011, Comput. Oper. Res..

[10]  Adele E. Howe,et al.  Understanding Algorithm Performance on an Oversubscribed Scheduling Application , 2006, J. Artif. Intell. Res..

[11]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[12]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[13]  Milind Dawande,et al.  Scheduling Support Times for Satellites with Overlapping Visibilities , 2008 .