40mm火箭弹储存失效机理分析

本文对40mm火箭弹进行了储存失效分析。以弹着目标不爆炸为顶事件建造失效树,求出最小割集和结构函数。通过对失效树的简化,建立可靠性数学模型,提出40弹爆炸作用失效的四种主要模式,并进行了失效机理分析。     

弹药保障信息自动识别系统研究

阐述了在弹药管理中应用自动识别技术的必要性和可行性。通过周密的需求分析及论证 ,确定了弹药保障信息条码自动识别系统的总体方案。介绍了二维条码生成系统和应用系统的开发设计过程。经试用后 ,得出该系统可有效解决弹药供应、管理中手工录入登记易出错、效率低的弊端 ,从而实现弹药信息自动识别录入和准确监控。     

军用航空发动机大修能力评估方法

针对航空发动机修理工厂大修能力难以评估的问题,提出了航空发动机大修能力评估方法。分析了航空发动机大修生产过程;根据航空发动机大修生产工作特点,建立了基于生产职能分解的航空发动机大修能力评估指标体系,构建出基于熵权和灰色聚类的评估指标赋权模型;结合实例验证了方法的正确性和实用性。     

舰炮制导弹药发展研究

从舰炮制导弹药的基本概念出发,结合其使命任务,对比中美两栖作战力量区别,指出发展低成本高精度制导兵器的必要性。总结当前国内外对制导弹药的研究现状,提取其关键技术,对比中外在顶层概念设计、系统交联、弹药实验测试等方面的发展差距,为下一步制导弹药的研究,提出了阶梯式、螺旋式发展、加强基础性研究工作、开展制导弹药协同控制技术研究等重要建议。     

带优先级的单类型航空弹药转运多目标规划模型

针对航母航空弹药转运过程非常复杂、涉及设备多、要求高的特点,在对其流程进行细致分析的基础上,将其抽象为一个两阶段多目标规划问题。同时,深入分析了转运过程中的各种约束条件、构建了该问题的两阶段优化模型。建模时,不仅考虑了武器升降机的有效利用、弹药量的合理分配等因素,还考虑了转运时对于不同类型弹药转运优先级与停机区弹药需求优先级的要求。通过模型优化,在满足转运优先级要求的基础上,能有效提高航空弹药的转运效率。     

某型弹药电磁耦合的仿真分析

利用电磁仿真软件FEKO建立了某型弹药模型和所需的电磁场环境,对某型弹药的电磁耦合规律进行仿真分析。仿真结果表明：在弹体内,中部位置由于金属连接底的影响,电场强度发生突变。弹药壳体顶部的电场与外界基本一致。内部引信位置电场强度与原电场强度相比有所衰减,但是不如内部其他位置明显。弹体内部电场强度在120 MHz和560 MHz处衰减较小;在弹体外部,存在着沿z轴和x轴方向强弱交替的电场。     

基于模糊影响图的库存弹药事故概率分析

指出了传统概率计算方法的局限性,提出了一种基于模糊影响图的库存弹药事故概率分析方法,对模糊影响图模型的构建过程和算法进行了描述;最后以弹药被盗事故为例进行了实例分析,并得出了结论。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

舰船建造费随批量变化的成长模型分析

应用微分方程、回归分析及生长曲线３段估算法,建立批量生产条件下舰船单价变化模型,这一模型可与其他模型综合应用以取得更理想的结果．     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011