Maximizing the value of a space mission
DOI10.1016/0377-2217(94)90385-9zbMATH Open0813.90078OpenAlexW2005186378MaRDI QIDQ1342007FDOQ1342007
Michael 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
heuristicLagrangean relaxationpreemptive relaxationmachine scheduling modelupper bounding proceduresvalue of a space mission
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Cites Work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with fixed start and end times
- Validation of subgradient optimization
- Title not available (Why is that?)
- Routing with time windows by column generation
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- Minimal Resources for Fixed and Variable Job Schedules
- On Transportation Problems with Upper Bounds on Leading Rectangles
- Plus court chemin avec contraintes d'horaires
- The Factored Transportation Problem
Cited In (17)
- Comparison of neural and heuristic methods for a timetabling problem
- Combinatorial optimization techniques for spacecraft scheduling automation
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization
- Title not available (Why is that?)
- 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
- Pricing and scheduling decisions with leadtime flexibility
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- A combinatorial flow-based formulation for temporal bin packing problems
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- Resource allocation with time intervals
- Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems
- 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
- Upper bounds for revenue maximization in a satellite scheduling problem
Recommendations
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)
