By Topic

A Mathematical Programming Solution to the Mars Express Memory Dumping Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Giovanni Righini ; Dipartimento di Tecnologie dell¿Informazione, Università degli Studi di Milano, Milano, Italy ; Emanuele Tresoldi

The problem of computing a schedule of maximum robustness for the Mars Express mission is formulated and solved via linear programming (LP). We also provide a characterization of ¿¿easy¿¿ and ¿¿difficult¿¿ instances such that the former ones can be solved to optimality directly, without having recourse to any optimization algorithm. In both cases, provably optimal solutions are obtained in shorter computing time compared to previously published approaches. Starting from the simplified model already described in the literature, we extend it to consider real constraints. For this purpose, we define an integer LP model with four different objective functions and develop a decision support system based on hierarchical optimization of the first two objectives and multicriteria optimization of the other two.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)  (Volume:40 ,  Issue: 3 )