An Approach for Spacecraft Operational Task Scheduling Considering Constrained Space–Ground TT&C Resources and Task Splitting

This paper proposes a scheduling approach for multi-type spacecraft operational tasks that can be interleaved, considering constrained space–ground telemetry, tracking, and command (TT&C) resources, as well as task splitting. A mixed-integer linear programming model is formulated to maximize the total task completion reward under service time-window constraints for splittable and unsplittable routine tasks, continuous tracking requirements, coupling relationships between routine and continuous tracking tasks, temporal logic dependencies, visibility constraints, and non-overlapping scheduling conditions. To improve solution efficiency and scheduling performance, a heuristic algorithm that combines priority rules with partial backtracking is developed. Task priorities are determined based on completion rewards, due times, execution durations, and temporal relationships, and scheduling is refined to avoid conflicts with predefined constraints. A partial backtracking mechanism guided by task release times enables effective adjustment when TT&C requirements cannot be satisfied. Comparative experiments with CPLEX and four heuristic algorithms validate the effectiveness of the proposed method.