Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling

Volumn 11, Issue 4, 2008, Pages 263-277

  Zufferey, Nicolas ^a   Amstutz, Patrick ^b   Giaccari, Philippe ^c  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b EPFL   (Switzerland)

^c UNIVERSITÉ LAVAL   (Canada)

Author keywords

Graph colouring heuristics; Oversubscribed satellite scheduling

Indexed keywords

ADAPTIVE MEMORY; CAPACITY CONSTRAINTS; FEASIBLE SCHEDULE; GRAPH COLOURING; GRAPH COLOURING HEURISTICS; NP-HARD; NUMERICAL EXPERIMENTS; OVERSUBSCRIBED SATELLITE SCHEDULING; SATELLITE RANGE SCHEDULING PROBLEM; SOLUTION SPACES;

ADAPTIVE ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; NUCLEAR PROPULSION; SATELLITES; SCHEDULING; TABU SEARCH;

MATHEMATICAL TRANSFORMATIONS;

EID: 49549117787     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0066-8     Document Type: Article

References (47)

1. Bar-Noy, A., Guha, S., Naor, J. S., & Schieber, B. (2002). Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2), 331-352.
2. Barbulescu, L., Watson, J.-P., Whitley, L. D., & Howe, A. E. (2004a). Scheduling space-ground communications for the air force satellite control network. Journal of Scheduling, 7(1), 7-34.
3. Barbulescu, L., Howe, A. E., Whitley, L. D., & Roberts, M. (2004b). Trading places: how to schedule more in a multi-resource oversubscribed scheduling problem. In International conference on automated planning and scheduling.
4. Barbulescu, L., Howe, A. E., & Whitley, L. D. (2006). AFSCN scheduling: how the problem and solution have evolved. Mathematical and Computer Modelling, 43(9-10), 1023-1037
5. Bensana, E., Lemaitre, M., & Verfaillie, G. (1999). Earth observation satellite management. Constraints, 4, 293-299.
6. Bianchessi, N., Cordeau, J.-F., Desrosiers, J., Laporte, G., & Raymond, V. (2007). A heuristic for the multi-satellite, multi-orbit and multi-user management of earth observation satellites. European Journal of Operational Research, 177, 750-762.
7. Bloechliger, I. (2005). Suboptimal colorings and solution of large chromatic scheduling problems. PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland.
8. Bloechliger, I., & Zufferey, N. (2008). A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research, 35, 960-975.
9. Brélaz, D. (1979). New methods to color vertices of a graph. Communications of the Association for Computing Machinery, 22, 251-256.
10. Cordeau, J.-F., & Laporte, G. (2005). Maximizing the value of an earth observation satellite orbit. Journal of the Operational Research Society, 56, 962-968.
11. Culberson, J. (1992). Iterated greedy graph coloring and the difficulty landscape (Tech. rept. TR 92-07). Department of Computer Science, University of Alberta, Edmonton.
12. Culberson, J. C., & Luo, F. (1995). Exploring the k-colorable landscape with iterated greedy. DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
13. Dauzère-Pérès, S. (1995). Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research, 81, 131-142.
14. Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
15. Frank, J., Jonsson, A., Morris, R., & Smith, D. (2001). Planning and scheduling for fleets of earth observing satellites. In Proceedings of the sixth international symposium on artificial intelligence, robotics, automation and space.
16. Gabrel, V., & Murat, C. (2003). Operations research in space and air. In Mathematical programming for Earth observation satellite mission planning. Boston: Kluwer Academic (Chap. 7).
17. Galinier, P., & Hao, J. K. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4), 379-397.
18. Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33, 2547-2562.
19. Galinier, P., Hertz, A., & Zufferey, N. (2008). An adaptive memory algorithm for the graph coloring problem. Discrete Applied Mathematics, 156, 267-279
20. Garey, M., & Johnson, D. S. (1979). Computer and intractability: a guide to the theory of np-completeness. San Francisco: Freeman.
21. Globus, A., Crawford, J., Lohn, J., & Pryor, A. (2003). Scheduling earth observing satellites with evolutionary algorithms. In International conference on space mission challenges for information technology, Pasadena, CA.
22. Globus, A., Crawford, J., Lohn, J., & Pryor, A. (2004). A comparison of techniques for scheduling earth observing satellites. In Proceedings of the sixteenth innovative applications of artificial intelligence conference (IAAI-04).
23. Glover, F. (1986). Future paths for integer programming and linkage to artificial intelligence. Computers & Operations Research, 13, 533-549.
24. Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic.
25. Gooley, T. D. (1993). Automating the satellite range scheduling process. M.Phil. thesis, Air Force Institute of Technology, USA.
26. Habet, D., & Vasquez, M. (2004). Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristic. In Sixteenth IEEE international conference on tools with artificial intelligence.
27. Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on numerical methods in combinatorial optimization, Capri, Italy.
28. Harrison, S. A., Philpott, M. S., & Price, M. E. (1999). Task scheduling for satellite based imagery. In Proceedings of the 18th workshop of the UK planning and scheduling special interest group (pp. 64-78), University of Salfort, UK.
29. Hertz, A., & Costa, D. (1997). Ants can color graphs. The Journal of the Operational Research Society, 48(3), 295-305.
30. Hertz, A., & de Werra, D. (1987). Using Tabu search techniques for graph coloring. Computing, 39, 345-351.
31. Hertz, A., Plumettaz, M., & Zufferey, N. (2007, accepted). Variable space search for graph coloring. Discrete Applied Mathematics.
32. Lemaitre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002). Selecting and scheduling observations of agile satellites. Aerospace Science and Technology, 6, 367-381.
33. Marinelli, F., Nocella, S., Rossi, F., & Smriglio, S. (2006). A Lagrangian heuristic for satellite range scheduling with resource constraints (Tech. rept. TRCS 004/2005). Dip. di Informatica, Università L'Aquila, Italy.
34. Meuwly, F.-X., Ries, B., & Zufferey, N. (2007). Heuristiques pour la coloration de graphes mixtes. Master thesis. Swiss Federal Institute of Technology, EPFL, Lausanne, Switzerland.
35. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097-1100.
36. Mladenović, N., Plastria, F., & Urošević, D. (2005). Reformulation descent applied to circle packing problems. Computers & Operations Research, 32, 2419-2434.
37. Morgenstern, C. (1996). Distributed coloration neighborhood search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26, 335-357.
38. Parish, D. A. (1994). A genetic algorithm approach to automating satellite range scheduling. M.Phil. thesis, Air Force Institute of Technology, USA.
39. Pemberton, J. C. (2000). Toward scheduling over-constrained remote-sensing satellites. In Proceedings of the second NASA international workshop on planning and scheduling for space.
40. Pinedo, M. (2002). Scheduling: theory, algorithms, and systems. New York: Prentice Hall.
41. Rochat, Y., & Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147-167.
42. Schlack, S. M. (1993). Automating satellite range scheduling. M.Phil. thesis, Air Force Institute of Technology, USA.
43. Syswerda, G., & Palmucci, J. (1991). The application of genetic algorithms to resource scheduling. In Proceedings of the 4th international conference on genetic algorithms (pp. 502-508). San Mateo: Morgan Kaufmann.
44. Vasquez, M., & Hao, J.-K. (2003). A "logic-constrained" knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Computational Optimization and Applications, 7, 87-103.
45. Verfaillie, G., & Lemaitre, M. (2001). Selecting and scheduling observations for agile satellites: some lessons from the contraint programming community point of view. In T. Walsh (Ed.), Principles and practice of constraint programming (pp. 670-684).
46. Wolfe, W. J., & Sorensen, S. E. (2000). Three scheduling algorithms applied to the earth observing systems domain. Management Science, 46, 148-168.
47. Zufferey, N. (2002). Heuristiques pour les problèmes de la coloration des sommets d'un graphe et d'affectation de fréquences avec polarités. Ph.D. thesis, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland.