期刊文献+

作战任务和资源间的匹配模型及求解算法研究 被引量:19

Research on the match model and solving method between operational tasks and resources
下载PDF
导出
摘要 针对作战任务和作战资源的匹配问题,提出了一种匹配模型及其求解算法。首先分析了作战任务和资源的属性,建立了匹配问题的约束满足模型。基于改进的多优先级动态列表规划算法提出了一种匹配模型的求解算法,并结合实例进行了分析验证。结果表明,算法中引入任务与资源选择优先权参数,可以有效消解优先权冲突,增加匹配的灵活性。 To solve the problem of matching between operational tasks and resources, a match model and its solving algorithm are presented. First, the property of operational tasks and the attribute of operational resources are pointed out and analyzed, and then the model of the matching problem is set up. At the same time, the solving algorithm for the model is put forward based on the multiPRI list dynamic scheduling (MPLDS), which introduces the priority parameter of operational tasks and resources. Finally, the model and algorithm are validated by an example, and the conclusion shows that the algorithm can decrease the conflict of priority and increases the agility of the matching result.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2008年第9期1712-1716,共5页 Systems Engineering and Electronics
基金 装备预研重点项目基金资助课题(6140538)
关键词 任务资源匹配 约束满足模型 改进的多优先级动态列表规划算法 冲突消解 match between operational task and resource task CSP model improved multiPRI list dynamic scheduling confliction elimination
  • 相关文献

参考文献6

  • 1Levchuk G M, Levchuk Y. N, Luo J, et al. A library of optimization algorithms for organizational design[C] //Proceedings of the 2000 Command and Control Research and Technology Symposium. Monterey, CA: NPS, 2000.
  • 2Levchuk G M, Levchuk Y N, Luo J, et al. Normative design of organizations-part I: mission planning[J].IEEETrans. on Systems, Man, and Cybernetics-Part A : Systems and Humans, 32 (3), 346 - 359.
  • 3阳东升,张维明,刘忠,鲁音隆.战役任务计划的数学描述与求解算法研究[J].系统工程理论与实践,2006,26(1):26-34. 被引量:32
  • 4阳东升.C2组织的有效测度与设计方法[D].国防科学技术大学博士学位论文,2004,10:81-84
  • 5王永炎,王强,王宏安,金宏,戴国忠.基于优先级表的实时调度算法及其实现[J].软件学报,2004,15(3):360-370. 被引量:68
  • 6李建军.面向作战任务的作战系统动态集成理论框架与实现机制研究[D].长沙:国防科技大学,2006.

二级参考文献11

  • 1Ramamritham K J,Stankovic A,Shiah P-F.Efficient scheduling algorithms for real-time multiprocessor systems[J].IEEE Transactions on Parallel and Distributed Systems,1990,1(2):184-194.
  • 2Manimaran G,Murthy C S R.An efficient dynamic scheduling algorithm for multiprocessor real-time systems[J].IEEE Transactions on Parallel and Distributed Systems,1998,9 (3):312-319.
  • 3Shirazi B,et al.Analysis and evaluation of Heuristic methods for static task scheduling[J].J.of Parallel and Distributed Computing,1990,10:222-232.
  • 4Muthucumaru Maheswaran and Howard Jay Siegel.A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems[M].HCW'98,pages 57-69,Orlando,USA,March 1998.IEEE Computer Society Press.
  • 5Hyunok Oh and Soonhoi Ha.A Static Scheduling Heuristic for Heterogeneous Processors.Proceedings of Europar' 96[M].Volume 1124 of Lecture Notes in Computer Science,pages 573-577,Lyon,France,August 1996.Springer-Verlag.
  • 6Volker Strassen.Gaussian elimination is not optimal[J].Numerische Mathematik,1969,14(3):354-356.
  • 7Gilbert Sih and Edward Lee.A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures[J].IEEE Transactions on Parallel and Distributed Systems,1993,4(2):175-187.
  • 8Levchuk Georgiy M,et al.Normative design of organizations-part Ⅰ:Mission planning[J].IEEE Transactions on Systems,man,and Cybernetics-part A:Systems and Humans,2002,32(3):346-359.
  • 9Levchuk G M,Levchuk Y N,Luo J,et al.Pattipati,A library of optimization algorithms for organizational design[A].Proceedings of the 2000 Command and Control Research and Technology Symposium[C].Monterey,CA:NPS,June 2000.
  • 10Kleinman D L,Young P,Higgins G S.The DDD-Ⅲ:A tool for empirical research in adaptive organizations[A].Proc.Command and Control Research and Technology Symp[C],Monterey,CA,June 1996.

共引文献100

同被引文献159

引证文献19

二级引证文献112

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部