Task scheduling algorithm for an air and missile defense radar

An algorithm for scheduling tasks for an air and missile defense radar is proposed. The algorithm consists of two sub-algorithms: a task interleaving algorithm followed by a distributed greedy scheduling algorithm. The interleaving algorithm efficiently interleaves range-unambiguous and range-windowed tasks (such as BMD-track tasks) based on knowledge of the task dwell characteristics. The output of the interleaving algorithm and the remaining tasks are then input to a greedy scheduling algorithm which attempts to schedule as many tasks as possible while maintaining temporal regularity between the task update intervals. Simulation results are provided to demonstrate the behavior of the proposed algorithm.