The TT&C demand of TT&C Scheduling problem was analyzed and a model of TT&C Scheduling 0-1 integer programming was constructed. The model's facility constraints and satellite constraints were relaxed by lagrangian relaxation method, and an upper bound of lagrangian dual problem by subgradient optimization algorithm was obtained. Finally, two examples were tested. The results demonstrate the validity of upper bound obtained by subgradient optimization algorithm.