To solve the contradiction of the scheduling success rate (SSR)

the time shifting rate (TSR) and the algorithm timeliness in the task scheduling of phased array radar

this paper proposes a scheduling algorithm based on the branch and bound method (BBM).Firstly

this algorithm acquires all executable tasks from available scheduling results

i.e.

obtaining several nodes on multiple layers

and forms several optional branches with these nodes through multistep recursion.In this way

the range of solution space is extended

and the algorithm performance is improved.Then

this algorithm discards branches with low yield and keeps the solution space to a certain range

which improves the accuracy of the algorithm and reduces the calculation amount.The simulation experiment indicated that compared with the algorithm based on integrated priority The simulation experiment suggested that the proposed algorithm enjoyed a 52% increase in scheduling success rate(SSR) over the traditional integrated priority algorithm

experienced a 61% reduction in the time shifting rate(TSR) compared with the time pointer algorithm

and took only 1~2% of the time consumed by the genetic algorithm.