Pages that link to "Item:Q1342007"
From MaRDI portal
The following pages link to Maximizing the value of a space mission (Q1342007):
Displaying 22 items.
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
- Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- Comparison of neural and heuristic methods for a timetabling problem (Q1268158) (← links)
- Combinatorial optimization techniques for spacecraft scheduling automation (Q1339156) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events (Q1666457) (← links)
- Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199) (← links)
- Upper bounds for revenue maximization in a satellite scheduling problem (Q1762888) (← links)
- Using the generalized assignment problem in scheduling the ROSAT space telescope (Q1806665) (← links)
- Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems (Q1926824) (← links)
- Minimization of the weighted total sparsity of cosmonaut training courses (Q2026164) (← links)
- Scheduling of a constellation of satellites: creating a mixed-integer linear model (Q2055368) (← links)
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem (Q2289905) (← links)
- Scheduling scientific experiments for comet exploration (Q2342608) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- Pricing and scheduling decisions with leadtime flexibility (Q2576254) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
