基于UML的兵力机动辅助决策软件设计

首先简要介绍了UML的建模体系,然后在使用UML对兵力机动辅助决策软件进行功能需求分析的基础上,进行了问题领域分析,建立了软件的静态和动态模型,并将该软件系统的各种要素、事件和活动,分别在时间和空间上进行了描述,方便开发人员之间的交流,为系统的分析、设计、维护及扩展提供了有利的支持,为兵力机动辅助决策软件系统的研制奠定了基础.     

水面舰艇编队防空火力分配的灰色局势决策方法

针对水面舰艇编队在防空作战时如何适时、适量地选取火力分配方案。采用定性定量相结合的方法,重点剖析了灰色局势决策方法的具体求解步骤,并将之应用于水面舰艇编队对空防御时的火力分配方案优选。最后,通过实例验证了该方法的严谨性。以此确定的最优局势更具可信性,符合军事决策的特点。     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

卫星数传调度模型研究

卫星数传调度问题是一个具有多时间窗口、多资源约束的优化问题。针对该问题,建立了卫星数传需求模型、任务模型和调度模型。在建模过程中,采用了框架模型形式,把问题中的主要约束封闭于每个数传任务中,这在降低调度模型复杂度的同时,也降低了调度算法设计难度。还提出了调度算法设计思想,并设计了一基于灵活度的调度算法。仿真表明,所建立的模型及算法对解决卫星数传调度问题是可行的。     

考虑可信度时导弹最大射程的Bayes评估

首先讨论了一种验前数据和现场试验数据相容性检验的新方法, 考虑验前信息可信度, 研究了导弹最大射程的 Ｂａｙｅｓ 评定和 Ｂａｙｅｓ 估计。最后给出了数据分析的例子。     

空对空多机协同攻击多个目标的战术决策研究

简要介绍多机协同攻击多目标的基本概念、战术决策、目标分配及攻击排序方法。最后用数字仿真（实例）验证该方法的有效性     

基于模糊综合决策的航迹相关算法

引用模糊综合决策的思想,提出一种新的分布式航迹相关算法．文中论述了多因素模糊综合评判的基本模型,详细讨论了合成运算模型的选择,重点研究了模糊综合航迹关联准则,并通过仿真将它与两种经典方法进行了比较．仿真结果表明,在密集目标环境下和／或交叉、分岔及机动航迹较多的场合,模糊航迹关联算法的性能明显优于传统方法,其正确关联率比传统方法提高了大约35％．     

坦克分队火力指挥理论研究

基于数理战术学理论,研究坦克分队最优火力运用策略问题,所得到的结论符合坦克分队作战的特点,为坦克分队辅助指挥决策系统的研究打下基础。     

武器系统的故障诊断方式及其模糊决策

文中提出了多种用于单级或多级的实时诊断方式,并采用模糊决策法对其进行优化选择。为新型武器系统故障诊断装置的总体方案设计,提供了一定的依据。