摘要
基于动态约束满足问题,针对初始方案执行过程中任务动态到达的情况,以最大化完成任务的优先级之和,并使新任务到达后,对原方案的调整最小为目标,建立了多卫星动态调度模型,提出了模型求解方法,最后给出了仿真算例,对模型和算法进行了验证.
This paper modeling the problem of multi-satellites dynamic scheduling focusing on the arriving of new tasks based on Dynamic CSP with objective to maximize the sum of tasks scheduled and minimizes the changes of the initial schedule after the all or some of new tasks insertion,. It gives a algorithm to solve the model and gives an example of the earth observation satellites to validate the model and algorithm at last.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2005年第4期35-41,共7页
Systems Engineering-Theory & Practice
关键词
动态约束满足
调度
模型
算法
Dynamic Constraint Satisfaction
Scheduling
Modeling
Algorithm
