Selection and scheduling of advanced missions for NASA using 0-1 integer linear programming

Selection and scheduling of advanced missions for NASA using 0-1 integer linear programming

0.00 Avg rating0 Votes
Article ID: iaor1990205
Country: United Kingdom
Volume: 40
Issue: 11
Start Page Number: 971
End Page Number: 981
Publication Date: Nov 1989
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: programming: integer
Abstract:

A 0-1 integer linear programme for the selection and scheduling of US National Aeronautics and Space Admistration (NASA) missions over a long planning horizon is presented. This model was formulated to allow a higher-level user-interaction with an advanced missions database currently being developed. The model implicitly considers the multi-objective nature of the problem, which results from the desire to maximize benefits in several categories as well as from the desire to minimize cost. In addition, the model allows the planner much flexibilty in the selection process. This is accomplished by allowing the planner the ability to specify long- or short-term budget constraints, precursor/follow-on mission requirements, or any number of other idiosyncratic constraints which might be of importance in the decision process. Small example problems are solved in order to illustrate the approach, and areas for further research are discussed.

Reviews

Required fields are marked *. Your email address will not be published.