Maximizing the value of a space mission

DOI10.1016/0377-2217(94)90385-9zbMath0813.90078OpenAlexW2005186378MaRDI QIDQ1342007

Michael J. Magazine, Nicholas G. Hall

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

Lagrangean relaxationheuristicpreemptive 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)

Related Items

Combinatorial optimization techniques for spacecraft scheduling automation, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events, Resource allocation with time intervals, Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems, Approximations for generalized unsplittable flow on paths with application to power systems optimization, A combinatorial flow-based formulation for temporal bin packing problems, Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization, 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, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem, Scheduling of a constellation of satellites: creating a mixed-integer linear model, Comparison of neural and heuristic methods for a timetabling problem, Pricing and scheduling decisions with leadtime flexibility, Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs with fixed start and end times
• The Factored Transportation Problem
• Plus court chemin avec contraintes d'horaires
• Routing with time windows by column generation
• On Transportation Problems with Upper Bounds on Leading Rectangles
• The Fixed Job Schedule Problem with Spread-Time Constraints
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• The Fixed Job Schedule Problem with Working-Time Constraints
• Minimal Resources for Fixed and Variable Job Schedules
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Validation of subgradient optimization