Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations

DOI10.1007/11493853_15MaRDI QIDQ5450931zbMATH OpenOpenAlexFDO

Authors Jeremy Frank, Elif Kurklu

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Combinatorial optimization techniques for spacecraft scheduling automation
• A branch and bound algorithm for agile earth observation satellite scheduling
• A constraint-based approach to satellite scheduling
• Three scheduling algorithms applied to the Earth observing systems domain
• A mixed integer linear programming model for multi-satellite scheduling

Cited in

(1)

• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm

This page was built for publication: Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450931)