对一体化联合作战的思考

对一体化联合作战的概念及基本特征作了介绍,探讨了研究一体化联合作战的迫切性,对我军一体化联合作战的的现状及如何加速提高我军一体化联合作战的能力作了详细的论述。     

基于SEA的舰载C3I系统防空作战效能评估模型

现代海战中,空中目标对舰艇的威胁越来越大,舰艇的防空作战能力已成为衡量其综合作战能力的主要指标。而C3I系统作为舰艇的指挥中枢,其性能直接决定着舰艇防空作战的成败。根据现代海战中空中目标的武器作战使用方式,并针对SEA方法的要求,提出了评估C3I系统在防空作战时系统效能的三个主要性能量度(MOP),通过分析C3I系统在防空作战时的特点,建立了评估C3I系统防空作战效能的SEA方法模型。并利用该模型比较了不同的C3I系统的作战效能,对结果进行了简要分析,证明了SEA方法模型对舰载防空C3I系统进行效能评估的可行性。     

网络中心作战体系效能评估方法初探

网络中心作战体系是信息化战争要求下的一个具体作战体系,其效能评估是网络中心战研究领域的重要问题,是解决网络中心作战体系建设中方案论证、性能效能指标、经济因素等诸多问题的有效方法。首先提出了网络中心作战体系效能评估的基本概念;然后阐述了网络中心作战体系效能评估方法问题,分析介绍了几种较为成熟的评估方法的特点、适用性和不足;最后提出一种基于探索性建模与分析方法的网络中心作战体系效能评估框架,作为研究网络中心作战体系效能评估的参考评估框架。     

基于可拓工程方法的舰空导弹作战通道性能分析

分析了舰空导弹作战通道性能的影响因素,应用可拓工程方法建立了舰空导弹作战通道性能多指标参数的物元可拓评估模型,以定量的结果对舰空导弹作战通道性能进行了评估分级,并与层次分析法的结果进行了比较,结论基本一致。为舰空导弹作战通道性能评估问题寻求出一种新方法,其评估结果可为决策提供定量依据。     

统计模型在火灾统计中的应用

通过分析已有的火灾统计数据,建立了简单的二元线性回归模型,并对此模型进行了显著性检验。分析表明违规操作和电气故障是群死群伤火灾的主要因素。可以利用此模型分析火灾统计中不同形式的数据,并进一步说明统计模型在火灾统计中的作用。     

基于场景的C2系统的模拟与评价方法

为适应一体化联合作战指挥控制系统快速决策与实时性能评价的要求,提出一种基于场景的系统快速模拟与评价模型.其优点在于①根据系统需求实现系统的建模、仿真代码自动生成及性能评价.②模型自适应能力强,系统场景设计中的冲突、不完整、安全、性能及行为错误等问题都可以通过仿真过程中不同方面的动态分析检测出来.     

舰艇协同作战导弹防御模型研究

舰艇协同作战是未来战争的主要作战形式,导弹防御是其主要的作战职责.运用信息论的方法对舰艇协同作战中敌方导弹发射策略的不确定性进行建模,运用可靠性理论对协作效果进行建模,并引进知识的概念作为其度量,同时用边的函数对网络复杂性进行建模,综合这两种因素在以最大化防御时间为总的决策目标,以己方导弹储备和敌方来袭速率为决策因素对导弹防御作出辅助决策.     

Relaxed sequencing games have a nonempty core

We study sequencing situations with a fixed initial order and linear cost functions. Cost savings can be obtained by rearranging jobs. Next to finding an optimal order, an additional issue is formed by the division of these savings. Cooperative game theory studies this issue. A common assumption states that cooperation between players is restricted to groups that are connected according to the initial order. The value of disconnected groups is defined additively over their connected components. In this paper we allow players in disconnected coalitions to switch places as long as they do not hurt the players not in the coalition under consideration. The resulting games are called relaxed sequencing games. Although they have been studied before, no general results on stable profit divisions have been derived so far. In this paper we prove that relaxed sequencing games have a nonempty core, i.e., they all have stable profit divisions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006