Timeliness Constrained Task Scheduling for Multifunction Radar Network

In this paper, considering the timeliness constrained tasks executed by heterogeneous radars, a multifunction radar network task scheduling problem is investigated. This problem is solved by the proposed timeliness constrained task scheduling algorithm. First, we propose a scheduling model in where the auction center collects the demand/supply information of all participants (task demanders and radars), and determines the task price according to the task deadlines of task demanders. To characterize the performance that radar executes different timeliness constrained tasks, we construct a revenue discount factor according to the starting prepare time (SPT) and fully prepare time (FPT) of radars. While, each radar in the network has different SPT and FPT. Then, for each task demander, all radars are classified into three categories according to revenue discount factors, and the radars with lower revenue discounts have higher priority to perform the timeliness constrained tasks. Under desired task completion ratio, we schedule the timeliness constrained tasks choosing overall revenue maximization as scheduling criterion. Finally, the provided numerical results verify the validity of the proposed task scheduling algorithm.