Scheduling Space–Ground Communications for the Air Force Satellite Control Network

We present the first coupled formal and empirical analysis of the Satellite Range Scheduling application. We structure our study as a progression; we start by studying a simplified version of the problem in which only one resource is present. We show that the simplified version of the problem is equivalent to a well-known machine scheduling problem and use this result to prove that Satellite Range Scheduling is NP-complete. We also show that for the one-resource version of the problem, algorithms from the machine scheduling domain outperform a genetic algorithm previously identified as one of the best algorithms for Satellite Range Scheduling. Next, we investigate if these performance results generalize for the problem with multiple resources. We exploit two sources of data: actual request data from the U.S. Air Force Satellite Control Network (AFSCN) circa 1992 and data created by our problem generator, which is designed to produce problems similar to the ones currently solved by AFSCN. Three main results emerge from our empirical study of algorithm performance for multiple-resource problems. First, the performance results obtained for the single-resource version of the problem do not generalize: the algorithms from the machine scheduling domain perform poorly for the multiple-resource problems. Second, a simple heuristic is shown to perform well on the old problems from 1992; however it fails to scale to larger, more complex generated problems. Finally, a genetic algorithm is found to yield the best overall performance on the larger, more difficult problems produced by our generator.

[1]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[2]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

[3]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[4]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[5]  Timothy D Gooley.  Automating the Satellite Range Scheduling Process , 1993 .

[6]  L. D. Whitley,et al.  The Traveling Salesman and Sequence Scheduling : , 1990 .

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

[8]  Joseph C. Pemberton.  Towards scheduling over-constrained remote sensing satellites , 2000 .

[9]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[10]  Peter Norvig,et al.  Planning and Scheduling for Fleets of Earth Observing Satellites , 2001 .

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

[12]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[13]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[14]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[15]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[16]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[17]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Gilbert Syswerda,et al.  The Application of Genetic Algorithms to Resource Scheduling , 1991, International Conference on Genetic Algorithms.

[20]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

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

[22]  Errol L. Lloyd,et al.  on the K-coloring of Intervals , 1991, Discret. Appl. Math..

[23]  Jean-Paul Watson,et al.  The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling , 1999 .

[24]  Kwangho Jang.  The Capacity of The Air Force Satellite Control Network , 1996 .

[25]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[26]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[27]  Stéphane Dauzère-Pérès,et al.  Minimizing late jobs in the general one machine scheduling problem , 1995 .

[28]  Saul Amarel,et al.  Stochastic heuristic search and evaluation methods for constrained optimization , 1998 .

[29]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[30]  Philippe Baptiste,et al.  Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints , 1998, CP.

[31]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[32]  Philippe Baptiste,et al.  A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..

[33]  Sarah Elizabeth Burrowbridge.  Optimal Allocation of Satellite Network Resources , 1999 .

[34]  J. Christopher Beck,et al.  Texture-Based Heuristics for Scheduling Revisited , 1997, AAAI/IAAI.

[35]  S. M. Schalck.  Automating Satellite Range Scheduling , 1993 .

[36]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[37]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[38]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[39]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[40]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..