Route-reduction-based dynamic programming for large-scale satellite range scheduling problem

DOI10.1080/0305215X.2018.1558445OpenAlexW2912997292WikidataQ128544370 ScholiaQ128544370MaRDI QIDQ5059256

Zhi-Gang Ren, Zhenbao Liu, Zu-Ren Feng

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1558445

zbMATH Keywords

dynamic programmingcombinatorial optimizationrange schedulingcritical resourceroute reduction

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Graph colouring approaches for a satellite range scheduling problem
• Multi satellites scheduling algorithm based on task merging mechanism
• On the tractability of satellite range scheduling
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Scheduling space-ground communications for the air force satellite control network

This page was built for publication: Route-reduction-based dynamic programming for large-scale satellite range scheduling problem