基于仿真的装备维修保障力量配置优化

装备维修保障力量的优化配置对于充分发挥维修保障效益、提高装备完好率具有重要意义。在分析界定装备维修保障力量配置问题的基础上,采用通用仿真语言建立了支持分析决策的仿真模型。实例分析表明维修力量最优配置是各区域的故障装备产生速率、后送运输时间等方面因素综合作用的结果,仿真程序可反映各项因素的定量关系。     

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     

紧固件自动拆装过程仿真的设计方法研究

介绍了一种在AUTOCAD环境下,用参数化造型法,实现紧固件拆装过程自动仿真的设计方法.该方法把维修工具及紧固件的设计、工具维修性力学分析,以及维修过程的图形仿真合成在一起.工具及紧固件可以在给定点自动实现三维造型,并可连续进行过程仿真;当施加在紧固件上的外力超过其规定的受力范围时,将以图形方式自动显示,帮助操作者对维修操作过程进行判断.     

美英海军舰船远海维修保障体系特点

我国海军执行远海护航与南海领海巡航任务已成常态化,同时随着"一带一路"国家战略的稳步实施,海军舰船必将走得更远,为经济建设与世界和平、地区稳定保驾护航。为了科学地构建我国远海舰船维修保障体系,本文分析总结美英国家海军舰船远海维修保障体系基本模式、特点及利弊,并在合理界定远海及远海维修保障概念的基础上,提出构建我国海军舰船远海维修保障体系的基本策略。     

航空维修活动中的组织知识存量

将知识管理的思想引入到航空维修中来,认为知识是构成维修活动的最基本要素,而知识存量的多少及应用的程度,反映在维修活动中就是维修能力的强弱.通过建立知识的增长模型,对构成航空装备维修的主要活动从知识的角度进行了分析,在此基础上建立了基于维修活动的航空维修组织知识存量度量模型,运用模糊综合评判的方法,给出了具体的算法步骤,最后通过算例进行具体分析,说明了该方法的有效性、实用性.     

基于过程建模的复杂装备虚拟维修训练仿真

针对复杂装备维修训练的特点,结合Petri网技术研究了维修作业过程的描述方法,建立了维修作业过程描述模型,可以清晰表达各维修作业间的逻辑关系、约束条件和维修保障资源的配置,引入时间概念也便于某些维修性分析工作的开展;基于此过程描述模型设计并开发了某型装备的虚拟维修训练系统,通过仿真实例,说明该系统可以有效地解决装备维修训练中存在的问题,具有一定的实用价值。     

BOM技术在复杂电路虚拟维修系统中的应用

给出了电路虚拟维修的定义,在复杂电路虚拟维修系统结构的基础上提出了建模需求,并给出了计算模型和交互模型的定义。以形式化的方法定义了BOM（Base Object Model）概念模型,通过分析电路仿真的特点,确定了电路BOM概念模型中的实体类型、事件类型和交互模式;特别是采用了“将实体类型区分电子元件类型和电信号类型,分别以客观属性和仿真语言描述的方法进行定义”的原则,既满足了仿真效果,又简化了建模复杂性。通过建立某型装备的复杂电路虚拟维修训练系统,验证了基于BOM的交互模型的有效性和实用性。     

考虑多类资源的多任务并行维修过程Petri网建模

针对基本Petri网在建立多种任务共享多类资源情况下的复杂并行维修过程时存在的结构复杂化问题,应用网抽象原理,由简入繁,将库所变迁网模型逐步转化为常量弧有色网和有色网模型,由单类任务/单类资源、单类任务/多类资源模型逐步建立了考虑多类资源的多任务并行维修过程模型。采用Petri网仿真分析工具ExSpect对有色网模型进行了实例研究。结果表明：模型具有通用性,便于仿真实现。     

基于指数平滑法的装备维修器材需求量预测

准确地预测维修器材需求量是制定装备保障计划的重要依据.针对装备维修器材需求量预测相对不够准确的问题,通过对两种预测方法进行比较,引入了适用于准确预测的指数平滑方法,建立了基于指数平滑法的装备维修器材需求量预测模型,介绍了确定初始值的方法,并以某种维修器材需求量预测为例进行了分析,为准确预测装备维修器材需求量提供了一种较为科学合理的方法.     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009