A Greedy Algorithm for Rocket TT&C Resource Scheduling in Flight-Style Launch Scenarios

In commercial aerospace flight-style launch scenarios, multiple parallel missions impose tight constraints, multiple objectives, and highly dynamic conditions on TT&C (Telemetry, Tracking, and Command) resource scheduling. This paper studies coordinated scheduling of TT&C equipment and sites. First, a multi-objective model is formulated that considers equipment–type matching, time-window constraints, mobile-equipment transfer paths, and coverage requirements. The model enforces coverage thresholds for all mission arc segments, while minimizing (i) the total travel distance of mobile equipment and (ii) the number of mobile units deployed. Second, to obtain high-quality feasible solutions quickly, an improved greedy scheduling algorithm is proposed. The algorithm processes tasks in chronological order and makes locally optimal decisions. It prioritizes fixed equipment and then selects mobile equipment by minimizing transfer distance under time-feasibility constraints. Finally, experiments on simulated scenarios demonstrate the effectiveness of the proposed method. The algorithm produces feasible schedules that satisfy coverage requirements in an extremely short time. It also provides a good initial solution for subsequent refinement, which makes it suitable for dynamic scheduling that requires real-time responsiveness.