Research on Mathematical Description and Solving Algorithms of Tasks Scheduling for Campaign
Yin-Long Lu · Systems Engineering - Theory & Practice · 2006
Tasks and platforms are defined in the case of joint campaign,on which mathematical description about campaign scheduling is given.For solving the problem of campaign scheduling,a new approach-multiPRI list dynamic scheduling(MPLDS) algorithm is advanced,with which vector distance between vectors of platform capability and task resource requirements is defined and a new search strategy is adopted.Results and compute complexities from MPLDS algorithms and traditional MDLS algorithms to solve our case are analyzed and compared.