Maximizing the value of a space mission

DOI10.1016/0377-2217(94)90385-9MaRDI QIDQ1342007zbMATH OpenOpenAlexFDO

Authors Nicholas G. Hall, Michael Magazine

Publication date 11 January 1995

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)90385-9

zbMATH Keywords

heuristicLagrangean relaxationpreemptive relaxationmachine scheduling modelupper bounding proceduresvalue of a space mission

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Recommendations

• Combinatorial optimization techniques for spacecraft scheduling automation
• scientific article; zbMATH DE number 176000
• scientific article; zbMATH DE number 1301850
• Using the generalized assignment problem in scheduling the ROSAT space telescope
• Resource-Constrained Assignment Scheduling

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Minimal Resources for Fixed and Variable Job Schedules
• On Transportation Problems with Upper Bounds on Leading Rectangles
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Plus court chemin avec contraintes d'horaires
• Routing with time windows by column generation
• Scheduling jobs with fixed start and end times
• The Factored Transportation Problem
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The Fixed Job Schedule Problem with Working-Time Constraints
• Validation of subgradient optimization

Cited in

(22)

• scientific article; zbMATH DE number 2221460 (Why is no real title available?)
• Breaking \(1-1/e\) barrier for nonpreemptive throughput maximization
• Comparison of neural and heuristic methods for a timetabling problem
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Scheduling of a constellation of satellites: creating a mixed-integer linear model
• Minimization of the weighted total sparsity of cosmonaut training courses
• Scheduling scientific experiments for comet exploration
• Scheduling satellite launch missions: an MILP approach
• Upper bounds for revenue maximization in a satellite scheduling problem
• Diversity controlling genetic algorithm for order acceptance and scheduling problem
• Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
• Combinatorial optimization techniques for spacecraft scheduling automation
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
• A combinatorial flow-based formulation for temporal bin packing problems
• Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems
• Resource allocation with time intervals
• Solving the swath segment selection problem through Lagrangean relaxation
• QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
• Pricing and scheduling decisions with leadtime flexibility
• A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds

This page was built for publication: Maximizing the value of a space mission

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