美军维修改革发展研究

维修保障是武器装备形成战斗力的关键要素。随着国际形势和美国国内经济、科技等方面的发展变化,美军的维修策略、维修技术以及维修保障信息化等方面也在不断变革。总结了2000年前后至今,美军在维修保障方面的重大变革,对其发展趋势进行了预测,并结合我军装备保障实际,积极探索切实可行的有效对策。     

水顶油顺序输送油水混合模型研究

顺序输送是利用一条管道输送多种油品,因其可最大限度发挥管道输送潜能而被广泛应用。按照前后行液体不同可分为水顶油、油顶水和不同油品间顺序输送等,其中水顶油顺序输送主要用于管道撤收前的排空作业。对水顶油顺序输送油水混合过程进行了分析,建立了油水混合模型,利用CFD对其进行数值求解,并将仿真结果与前期理论分析进行了对比,两者吻合较好。所得结论可为机动管线水顶油排空作业提供科学指导。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Model parameter estimation and residual life prediction for a partially observable failing system

We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Warranty costs: An age‐dependent failure/repair model

An age‐dependent repair model is proposed. The notion of the “calendar age” of the product and the degree of repair are used to define the virtual age of the product. The virtual failure rate function and the virtual hazard function related to the lifetime of the product are discussed. Under a nonhomogeneous Poisson process scenario the expected warranty costs for repairable products associated with linear pro‐rata, nonrenewing free replacement and renewing free replacement warranties are evaluated. Illustration of the results is given by numerical and graphical examples. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于任务能力的装备维修保障资源重组研究

分析了装备维修保障资源配置存在的问题,指出依据装备维修保障系统承担的任务和应具备的能力实施资源重组,是提高装备维修保障效能的基本途径．在此基础上,着重阐述了装备维修保障任务、功能、资源映射关系,提出了部队装备维修保障资源重组的实施框架、主要内容和基本方法．最后,进行了实例分析．     

基于级库存的维修器材整合供应策略研究

针对传统器材供应模式效率低的问题,借助供应链管理的思想提出了多需求点整合供应模式,并建立了基于级库存策略的整合优化模型,对成本各组成部分分析求解,得到了最优总成本对应的策略参数,其中总成本考虑了供应中心补货成本、库存持有成本、供应成本和供应延迟成本．最后通过算例与直接供应策略进行了比较,证明了整合供应策略的有效性．     

舰船维修器材保障点选址决策模型及算法

传统的最大覆盖选址模型没有考虑对服务半径外的需求点的满足和服务时间的响应,而在舰船维修器材保障中,不论需求点到保障点的距离是否大于服务半径,都应对其进行保障服务,且在保障过程中要满足保障时间控制在不影响舰船正常维修任务时间内。针对此问题,运用广义最大覆盖选址模型和时间满意度函数,构建基于时间满意的广义最大覆盖选址模型,并运用一种混合算法———基于遗传模拟退火算法的BP算法对模型进行求解。最后,运用该算法对实例进行了分析计算,计算结果验证了该算法的有效性。     

本体驱动的多分辨率联邦一致性维护方法

传统的聚合解聚方法仅能解决语法层的数据聚合解聚的参数静态匹配问题,却不能解决联邦一致性的其他两个重要的方面:数据的语义匹配合理性及联邦运行中的动态一致性。为了解决以上两个问题,提出了一种本体驱动的多分辨率联邦一致性维护框架——OCM框架。该框架基于本体创建与融合技术构建联邦本体,通过邦员本体与联邦本体间的映射,解决了联邦数据匹配的合理性问题;基于聚合解聚方法,引入管理与协调联邦实体状态的邦员,通过合理设计联邦的实时对象更新及交互机制,实现了联邦实体状态的实时一致性。实验结果表明:OCM框架能有效保持联邦中多分辨率实体的状态一致,并且由于联邦本体的可重用性,对邦员的增加与退出不敏感,因此联邦的重组合也具有一定的借鉴价值。