舰舰导弹攻击样式选择的决策分析

根据舰舰导弹攻击时使用雷达方式的不同,可将舰舰导弹攻击主要归结为三种样式,即其他兵力引导攻击样式、被动雷达攻击样式和主动雷达发波攻击样式。衡量各个攻击样式优劣主要考虑攻击的隐蔽性、命中率和发挥武器最大射程等三个因素。为此建立舰舰导弹攻击样式选择问题的递阶层次结构模型,从衡量各攻击样式优劣的三个主要因素出发,对模型进行了分析。最后得出了以其他兵力引导攻击为最佳攻击样式的结论。     

基于集对分析的战场态势分析模型

在防空作战中,战场态势的分析非常重要,它是辅助决策的基础.针对战场态势的问题,以集对分析的同异反联系度和距离测度为基础,构造了战场态势的分析模型,进行了深入探讨.最后,通过实例计算表明了分析模型对于评估战场态势的可行性和有效性.     

深弹武器系统效能分析

针对火箭深弹反潜武器系统的组成及其特点,运用可靠性理论和效能评估理论分析系统的作战效能.利用随机过程理论中的马尔可夫过程理论,采用美国工业武器系统效能咨询委员会(WSEIAC)提出的ADC效能模型,建立了系统的效能评估模型.借助Matlab工具对该效能模型进行了仿真研究,经对仿真结果分析后表明,该模型能较符合实际地反映系统各组成要素性能对系统总体效能的影响,较好地满足系统效能评价的需求,有助于系统装备的研制和战术使用决策.     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

可靠度限制下相控阵雷达天线阵面T/R单元维修模型

为了描述维修活动对相控阵雷达天线阵面系统的影响,构建了以可靠度为基础的“修旧不如新”定期维修优化模型。对相控阵雷达T/R单元失效下的天线性能参数进行分析,根据指标确定系统不能正常工作的失效T/R单元阈值; 针对大部分维修活动都难以使T/R单元修复如新的事实,引入失效率递增因子,在系统一定的可靠度水平上,以相控阵雷达系统的使用可用度和维修费用率为优化决策参数,建立了系统的维修优化模型,并运用边际效能算法对系统的最佳预防换件维修周期和换件维修组数量进行求解。实例运算结果表明,该模型突破了已有模型“修旧如新”的限制条件,更符合实际,能为维修策略的制定提供理论依据。     

Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.     

二次流引射对保形非对称喷管性能的影响

发动机与飞机后体结构设计合理与否直接影响发动机的部件匹配和性能。利用三维雷诺平均N-S方程和k-ωSST湍流模型对飞翼布局无人机保形非对称喷管在典型飞行状态下开展了内外流流场特性的数值分析,获得了后体尾喷管推力性能和三维流动特征随二次流压力比的变化趋势。结果表明:发动机喷管落压比条件一定的前提下,通过合理优化二次流通道、增大二次流压力比,可以有效改善后体/喷管主流流场特性;当二次流与主流的流量比在0. 2%～1. 86%内时,后体尾喷管轴向推力系数的变化幅度大约为3%,在一定程度上能够减弱发动机主流的过膨胀程度,减小发动机推力损失,无人机后体尾喷管性能得到显著提高。     

Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.