Generating high quality schedules for a spacecraft memory downlink problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 570-584

  Oddi, Angelo ^a   Policella, Nicola ^a   Cesta, Amedeo ^a   Cortellessa, Gabriella ^a  

^a INSTITUTE OF COGNITIVE SCIENCES AND TECHNOLOGIES   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; OPTIMIZATION; SPACE FLIGHT;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEM; CONSTRAINT-BASED MODELING; EUROPEAN SPACE AGENCY; LIMITED COMMUNICATION; METAHEURISTIC STRATEGY; OBJECTIVE FUNCTIONS; RANDOMIZED SEARCH;

SPACECRAFT;

EID: 33746224775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_39     Document Type: Article

References (11)

1. Cesta, A., Oddi, A., Cortellessa, G., Policella, N.: Automating the Generation of Spacecraft Downlink Operations in MARS EXPRESS: Analysis, Algorithms and an Interactive Solution Aid. Technical Report MEXAR-TR-02-10 (Project Final Report), ISTC-CNR [PST], Italian National Research Council (2002)
2. Verfaillie, G., Lemaitre, M.: Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View. In: Principles and Practice of Constraint Programming - CP 2001 - LNCS 2239. (2001)
3. Bensana, E., Lemaitre, M., Verfaillie, G.: Earth Observation Satellite Management. Constraints: An international Journal, 4 (1999) 293-299
4. Resende, M., Ribeiro, C.: Greedy Randomized Adaptive Search Procedures. In Glover, F., Kochenberger, G., eds.: Handbook of Metaheuristics. Kluwer Academic Publishers (2002) 219-249
5. Motwani, S., Raghavan, P.: Randomized Algorithms. Cambrige University Press, New York, NY (1995)
6. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Annals of Discrete Mathematics 4 (1979) 287-326
7. Lenstra, J.K.: Notes from Berkeley, July 11,1980. Personal Communication (2002)
8. Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London and San Diego, CA (1993)
9. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
10. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1 (1977) 343-362
11. Cesta, A., Cortellessa, G., Oddi, A., Policella, N.: A CSP-based Interactive Decision Aid for Space Mission Planning. In: Proceedings of AI*IA '03. Lecture Notes in Artificial Intelligence, Springer (2003)