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.

CrossRef
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.

CrossRef
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*.

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

CrossRef
Bensana, E., Lemaitre, M., & Verfaillie, G. (1999). Earth observation satellite management.

*Constraints*,

*4*, 293–299.

CrossRef
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.

CrossRef
Bloechliger, I. (2005). *Suboptimal colorings and solution of large chromatic scheduling problems*. PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland.

Bloechliger, I., & Zufferey, N. (2008). A graph coloring heuristic using partial solutions and a reactive tabu scheme.

*Computers & Operations Research*,

*35*, 960–975.

CrossRef
Brélaz, D. (1979). New methods to color vertices of a graph. *Communications of the Association for Computing Machinery*, *22*, 251–256.

Cordeau, J.-F., & Laporte, G. (2005). Maximizing the value of an earth observation satellite orbit.

*Journal of the Operational Research Society*,

*56*, 962–968.

CrossRef
Culberson, J. (1992). *Iterated greedy graph coloring and the difficulty landscape* (Tech. rept. TR 92-07). Department of Computer Science, University of Alberta, Edmonton.

Culberson, J. C., & Luo, F. (1995). Exploring the *k*-colorable landscape with iterated greedy. *DIMACS Series in Discrete Mathematics and Theoretical Computer Science*.

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.

Davis, L. (1991). *Handbook of genetic algorithms*. New York: Van Nostrand Reinhold.

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*.

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).

Galinier, P., & Hao, J. K. (1999). Hybrid evolutionary algorithms for graph coloring.

*Journal of Combinatorial Optimization*,

*3*(4), 379–397.

CrossRef
Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring.

*Computers & Operations Research*,

*33*, 2547–2562.

CrossRef
Galinier, P., Hertz, A., & Zufferey, N. (2008). An adaptive memory algorithm for the graph coloring problem.

*Discrete Applied Mathematics*,

*156*, 267–279

CrossRef
Garey, M., & Johnson, D. S. (1979). *Computer and intractability: a guide to the theory of np-completeness*. San Francisco: Freeman.

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.

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)*.

Glover, F. (1986). Future paths for integer programming and linkage to artificial intelligence.

*Computers & Operations Research*,

*13*, 533–549.

CrossRef
Glover, F., & Laguna, M. (1997). *Tabu search*. Boston: Kluwer Academic.

Gooley, T. D. (1993). *Automating the satellite range scheduling process*. M.Phil. thesis, Air Force Institute of Technology, USA.

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*.

Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. In *Congress on numerical methods in combinatorial optimization*, Capri, Italy.

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.

Hertz, A., & Costa, D. (1997). Ants can color graphs. *The Journal of the Operational Research Society*, *48*(3), 295–305.

Hertz, A., & de Werra, D. (1987). Using Tabu search techniques for graph coloring.

*Computing*,

*39*, 345–351.

CrossRef
Hertz, A., Plumettaz, M., & Zufferey, N. (2007, accepted). Variable space search for graph coloring. *Discrete Applied Mathematics*.

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.

CrossRef
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.

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.

Mladenović, N., & Hansen, P. (1997). Variable neighborhood search.

*Computers & Operations Research*,

*24*, 1097–1100.

CrossRef
Mladenović, N., Plastria, F., & Urošević, D. (2005). Reformulation descent applied to circle packing problems.

*Computers & Operations Research*,

*32*, 2419–2434.

CrossRef
Morgenstern, C. (1996). Distributed coloration neighborhood search. *DIMACS Series in Discrete Mathematics and Theoretical Computer Science*, *26*, 335–357.

Parish, D. A. (1994). *A genetic algorithm approach to automating satellite range scheduling*. M.Phil. thesis, Air Force Institute of Technology, USA.

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*.

Pinedo, M. (2002). *Scheduling: theory, algorithms, and systems*. New York: Prentice Hall.

Rochat, Y., & Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing.

*Journal of Heuristics*,

*1*, 147–167.

CrossRef
Schlack, S. M. (1993). *Automating satellite range scheduling*. M.Phil. thesis, Air Force Institute of Technology, USA.

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.

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.

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).

Wolfe, W. J., & Sorensen, S. E. (2000). Three scheduling algorithms applied to the earth observing systems domain.

*Management Science*,

*46*, 148–168.

CrossRef
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.