模糊一致矩阵的AHP在装备采购风险评价中的应用

针对传统层次分析法的不足,在装备采购风险评价中引入了基于模糊一致矩阵的层次分析法,提出了装备采购风险评价的模糊层次分析方法,不但解决了传统层次分析法中判断矩阵一致性的检验、调整和判断标准等问题,而且充分集成了多个专家的知识和经验,使决策过程更贴近实际,更便于理解。算例分析结果验证了所提出装备采购风险评价方法的可行性和有效性。     

着色Petri网的装备维修工艺建模

通过对装备维修工艺过程及其特点的分析,确定了基于Petri网建模方法的维修工艺优化过程模型。首先依据基本的维修拆卸规则和Petri网建模规则建立了工序Petri网模型,在此基础上以维修人员和通用维修机、工具为主要资源约束建立了维修工艺过程CPN模型。最后,通过装甲装备某部件维修的工艺过程仿真及数据分析确定了该建模方法的有效性和实用性。CPN较好地描述了装备维修工艺过程中的选择、冲突等事件,对指导维修工艺实践和工艺优化起到了积极的作用。     

自动测试系统多层次模糊综合评价方法

针对自动测试系统(ATS)多层次、多指标综合评价问题,提出了一种多层次模糊综合评价方法。首先通过德尔菲法确定系统的评价指标体系,并通过领域专家确定底层指标的隶属度矩阵;然后采用层次分析法确定各层指标的权重,并经过一致性检验;将底层的评价结果作为其上一层的隶属度矩阵,再根据相应层的权重进行评价,得到该层的评价结果。依次类推到最顶层,得到系统的最终评价结论和量化结果。最后以某型ATS为例验证了其有效性。     

含万向铰偏斜轴系的过渡过程横扭耦合振动特性

为提供船艇推进、火炮、航空动力及传动装置机械设计的理论分析基础,建立了加速度冲击下含万向铰偏斜轴系横扭耦合振动模型,揭示了轴系的过渡过程横扭耦合振动特性。将从动轴视为弯曲刚性、扭转柔性的轴,用投影平面上动态偏斜角表示轴系横向振动,用拉格朗日方程推导了万向铰轴系过渡过程横扭耦合三自由度振动微分方程,结合振动响应仿真给出了加速度和系统参数对轴系过渡过程横扭耦合振动特性的影响规律。结果表明:负载转矩增大和刚度不对称性减小导致耦合振动系统颤振失稳区增大;在超谐共振区内,加速度增大对过渡过程系统振动起稳定作用,转矩、刚度和偏斜角增大导致过渡过程系统振动失稳区域变大。     

基于FAHP-GP的装备调配保障决策模型

分析了装备调配保障决策的主要流程、影响因素和基本模式;根据装备调配保障决策的特点和装备调配保障所面临的实际问题,将模糊层次分析法与目标规划法相结合,构建了装备调配保障决策模型,较好地解决了装备调配保障需求与资源之间的矛盾。最后,以某装备的调配保障决策为例,给出了该模型的求解方法和结果,验证了模型的可行性和有效性。     

基于实体的指挥控制仿真建模

指挥控制是军队遂行军事任务的关键环节,对指挥控制过程进行建模并采用仿真的方法对其效能进行评估,进而考察指挥控制系统的典型效能指标是否符合预期的需求,具有重要的理论和应用意义。采用基于实体的仿真建模方法,提出指挥控制过程的实体仿真建模框架,以信息流为重点,从信息获取、信息融合、信息共享、自身任务规划、作战筹划、部队掌控、任务执行和信息输出等八个方面对其进行建模,实现了对指挥控制过程的描述,有效支撑了指挥控制系统仿真效能评估。     

System reliability based on diffusion models for fatigue crack growth

Diffusion processes are commonly used to describe the dynamics of complex systems arising in a wide range of application fields. In this paper we propose, on the basis of diffusion processes, two models concerned with the stochastic behavior of fatigue cracks in a system. They are then used to get the distribution of the failure time, the first time the crack size of at least one of the cracks exceeds a given value. Several properties of our proposed models are presented, and the unknown parameters are estimated by the method of maximum likelihood. From these an estimate of failure time distribution is obtained. In this part, contrary to common practice, we do not assume availability of failure data. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Properties of the geometric and related processes

Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004