.png){kind=icon}
.png){kind=icon}
Return
Nested branch-and-price for multi-mode nanosatellite task scheduling with interior-point regularization and GPU acceleration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2025.05.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Introduced multi-mode scheduling for nanosatellite task planning. • Proposed Nested Branch-and-Price (NB&P) for hierarchical scheduling. • Used GPU-accelerated dynamic programming with CUDA for large instances. • Achieved up to 629-fold reduction in computation time with zero-gap solutions.
Keywords:
multi-mode scheduling
hierarchical scheduling
Nested Branch-and-Price
GPU-accelerated dynamic programming
nanosatellite task planning
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available