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

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

C2组织行为分析及测试问题描述

针对C2组织闭环测试需求,分析了C2组织的组成要素及要素的数据属性,从C2组织的行为主体或对象角度划分C2组织行为为全局行为和局部(或个体)行为,描述了C2组织的行为过程,提出了C2组织测试的问题及问题的描述。     

装备维修保障的多目标优化模型研究

通过对装备维修保障问题进行分析,针对目前研究的目标单一,就修复后的加权作战时间和装备尽可能短的延误双重目标加以研究,建立了维修保障的多目标优化模型,并给出了模型的求解算法,从而弥补了这些不足,使维修保障更加合理。最后,算例表明模型的求解方法简单,计算时间较短,是一种便于实现的好算法。     

通用军械装备维修备件合同商保障方式研究

提出了备件合同商保障的概念,给出了备件合同商保障内容和维度,分析了备件合同商保障的特征,着重从备件的存储方式和供应方式两个方面进行了定性分析,为实施备件合同商保障奠定了理论基础．     

考虑机内测试诊断的维修任务模型及算法

机内测试设备（Built—in Test Equipment,BITE）在复杂系统中的应用越来越多,由于BITE诊断存在不确定性,就可能导致无效的维修．采用一种考虑BITE诊断不确定性的维修任务选择模型及其求解算法,以在一定置信水平下获得最佳的维修方案．首先,给出了考虑BITE诊断不确定性的维修任务选择问题的假设条件,建立了非线性的、离散的随机机会约束规划模型．其次,设计了求解随机机会约束规划模型的一种基于随机模拟的粒子群算法,包括粒子的表示、适应度函数、更新公式、算法框架等．最后,给出了具体实例,证明了模型与算法的有效性．该模型适用于管理人员在考虑BITE诊断不确定性的情况下做出合理的维修任务选择决策．     

车辆装备保障分队单兵训练质量组合评价分析

针对当前部队车辆装备保障分队单兵训练质量评价中所存在的问题和不足,综合运用集对分析一四元联系数理论、马尔可夫链模型和熵权双基点法,尝试提出一种新的评价分析方法——SHE组合评价分析法,排除单兵原有基础差异对年度训练考核成绩的影响,考虑评价对象之间的情感因素和分队训练条件对单兵训练质量的影响,从而使评价显得更加客观、公正和公平．最后,结合算例,分析说明了此方法的具体应用．     

Optimal joint preventive maintenance and production policies

We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

软件可维护性的一种定量计算方法

软件可维护性是软件维护难易程度评价的标准,为实现软件可维护性的定量计算,在介绍波动效应的基础上,根据软件可维护性计算的基本思路和基本原理,建立了基于波动效应分析的软件可维护性计算模型,并对模型进行了分析和校验。     

直升机工作特性建模与飞行性能仿真

以涡轮轴发动机工作特性建模为中心,对某系列直升机飞行性能进行仿真研究,力争实现对直升机实施"基于状态的维修"。讨论了直升机飞行性能和涡轮轴发动机特性的表述方法,建立了涡轮轴发动机的数学模型,并讨论了其解法与应用。基于发动机台架性能仿真程序对该模型进行简化,得到涡轮轴发动机工作过程的热力学模型。对发动机性能进行计算完成飞行性能仿真,应用结果表明该方法是可信、高效的。     

Scheduling maintenance and semiresumable jobs on a single machine

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999