Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Arkin, E. M. E. B. Silverberg, “Scheduling jobs with fixed start and end times,” Discrete Appl. Math., 18, 1–8 (1987).
Baptiste, P., C. Le Pape, L. Peridy, “Global constraints for partial CSPs: A case-study of resource and due date constraints,” in M. Maher and J.-F. Puget (eds.), Principles and Practice of Constraint Programming—CP98, Springer, pp. 87–101, 1998.
Baptiste, P., and L. Peridy, E. Pinson, “A branch and bound to minimize the number of late jobs on a single machine with release time constraints,” Eur. J. Oper. Res., 144(1), 1–11 (2003).
Bar-Noy, A., S. Guha, Joseph (Seffi) Naor, B. Schieber, “Approximating the throughput of multiple machines in real-time scheduling,” SIAM J. Comput., 31(2), 331–352 (2002).
Beck, J. C., A. J. Davenport, E. M. Sitarski, and M. S. Fox, “Texture-based heuristic for scheduling revisited,” in Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97) Providence, RI, AAAI Press/ MIT Press, 1997, pp. 241–248.
Bresina, J. L., “Heuristic-biased stochastic sampling,” in Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, OR, 1996, pp. 271–278.
Bresina, J. L., “Stochastic heuristic search and evaluation methods for constrained optimization,” Ph.D. Thesis, Graduate School-New Brunswick, Rutgers, The State University of New Jersey, 1998.
Burrowbridge, S. E., “Optimal allocation of satellite network resources,” Masters Thesis, Virginia Polytechnic Institute and State University, 1999.
Carlisle, M. C. and E. L. Lloyd, “On the k-coloring of intervals,” Discrete Appl. Math., 59, 225–235 (1995).
Cormen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
Dauzère-Pérès, S., “Minimizing late jobs in the general one machine scheduling problem,” Eur. J. Oper. Res., 81, 131–142 (1995).
Davis, L. (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
Frank, J., A. Jonsson, R. Morris, and D. E. Smith, “Planning and scheduling for fleets of earth observing satellites,” in International Symposium on Artificial Intelligence, Robotics, Automation and Space, 2001, Montreal, Canada.
Garey, M. S., and D. S. Johnson, “Two-processor scheduling with start-times and deadlines,” SIAM J. Comput., 6, 416–426 (1977).
Garey, M. S. and D. S. Johnson, Computers And Intractability: A Guide To The Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
Glover, F. and M. Laguna, Tahu Search, Kluwer Academic Publishers, Boston, MA, 1997.
Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
Gooley, T. D., “Automating the satellite range scheduling process,” Masters Thesis, Air Force Institute of Technology, 1993.
Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: A survey,” Ann. Discrete Math., 5, 287–326 (1979).
Harvey, W. D. and M. L. Ginsberg, “Limited discrepancy search,” in Proceedings of the Fourteenth International Joint Conference on A.I., Montreal, Canada, 1995.
Jang, K., “The capacity of the air force satellite control network,” Masters Thesis, Air Force Institute of Technology, 1996.
Joslin, D. E. and D. P. Clements, “‘Squeaky Wheel’ optimization,” J. Art. Intell. Res., 10, 353–373 (1999).
Parish, D. A., “A genetic algorithm approach to automating satellite range scheduling,” Masters Thesis, Air Force Institute of Technology, 1994.
Pemberton, J. C., “Toward scheduling over-constrained remote-sensing satellites,” in Proceedings of the Second NASA International Workshop on Planning and Scheduling for Space, San Francisco, CA, 2000.
Schalck, S. M., “Automating satellite range scheduling,” Masters Thesis, Air Force Institute of Technology, 1993.
Smith, S. and C. C. Cheng, “Slack-based heuristics for constraint satisfaction problems,” in Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), AAAI Press/MIT Press, Washington, DC, 1993, pp. 139–144.
Spieksma, F. C. R., “On the approximability of an interval scheduling problem,” J. Sched., 2, 215–227 (1999).
Syswerda, G., “Schedule optimization using genetic algorithms,” in L. Davis (eds.), Handbook of Genetic Algorithms, Chapter 21, Van Nostrand Reinhold, NY, 1991.
Syswerda, G. and J. Palmucci, “The application of genetic algorithms to resource scheduling,” in L. Booker and R. Belew (eds.), Proceedings of the Fourth International Conference on GAs, Morgan Kaufmann, 1991.
Taillard, E. D., “Some efficient heuristic methods for the flow shop sequencing problem,” Eur. J. Oper. Res., 47, 65–74 (1990).
Taillard, E. D., “Comparision of iterative searches for the quadratic assignment problem,” Location Sci., 3(2), 87–105 (1995).
Vazquez, M. and D. Whitley, “A comparison of genetic algorithms for the static job shop scheduling problem,” in Schoenauer, Deb, Rudolph, Lutton, Merelo, and Schwefel (eds.), Parallel Problem Solving from Nature, 6, Springer, 2000, pp. 303–312.
Watson, J. P., S. Rana, D. Whitley, and A. Howe, “The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling,” J. Sched., 2(2), 79–98 (1999).
Watson, J.-P., L. Barbulescu, L. D. Whitley, and A. E. Howe, “Contrasting structured and random permutation flow-shop scheduling problems: Search space topology and algorithm performance,” INFORMS J. Comput., 14, (2002).
Whitley, D. L., “The GENITOR algorithm and selective pressure: Why rank based allocation of reproductive trials is best,” in J. D. Schaffer (ed.), Proceedings of the Third International Conference on GAs Morgan Kaufmann, 1989, pp. 116–121.
Whitley, D., T. Starkweather, and D'ann Fuquay, “Scheduling problems and traveling salesmen: The genetic edge recombination operator,” in J. D. Schaffer (ed.), Proceedings of the Third International Conference on GAs, Morgan Kaufmann, 1989.
Whitley, L. D., T. Starkweather, and D. Shaner, “The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination,” in L. Davis (ed.), Handbook of Genetic Algorithms, Chapter 22, Van Nostrand Reinhold, 1991, pp. 350–372.
Wolfe, W. J., S. E. Sorensen, “Three scheduling algorithms applied to the earth observing systems domain,” In Manage. Sci., 46(1), pp. 148–168 (2000).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Barbulescu, L., Watson, JP., Whitley, L.D. et al. Scheduling Space–Ground Communications for the Air Force Satellite Control Network. Journal of Scheduling 7, 7–34 (2004). https://doi.org/10.1023/B:JOSH.0000013053.32600.3c
Issue Date:
DOI: https://doi.org/10.1023/B:JOSH.0000013053.32600.3c