基于不确定性理论的研制技术风险评估方法研究

分析了装备研制技术风险的含义,根据技术风险的特点建立了评价技术风险的指标体系。在技术风险度量中引入不确定性理论的概念,并建立了基于不确定性的技术风险的度量方法,对综合技术风险进行评价。最后通过实例验证了综合评价方法的可用性。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A model to predict the residual life of aircraft engines based upon oil analysis data

This paper reports on a study using the available oil monitoring information, such as the data obtained using the Spectrometric Oil Analysis Programme (SOAP), to predict the residual life of a set of aircraft engines. The relationship between oil monitoring information and the residual life is established using the concept of the proportional residual, which states that the predicted residual life may be proportional to the wear increment measured by the oil analysis programmes. Assuming such a relationship between wear and the residual life exists, we formulated a recursive prediction model for the item's residual life given measured oil monitoring information to date. A set of censored life data of 30 aircraft engines (right censored due to preventive overhaul) along with the history of their monitored metal concentration information are available to us. The metal concentration information includes many variables, such as Fe, Cu, Al, etc.; not all of them are useful, and some of them may be correlated. The principal component analysis (PCA) has been adopted to reduce the dimension of the original data set and to produce a new set of uncorrelated variables, which we shall use in the prediction model. The procedure associated with estimating model parameters is discussed. The model is fitted to the actual SOAP data from the aircraft engines, and the goodness‐of‐fit test has been carried out. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

面向C4ISR系统的风险识别技术研究

分析了C4ISR系统的基本结构及其风险特性,针对目前C4ISR系统风险识别方法局限性大的问题,提出利用层次全息图技术分别从不同视角来透视风险来源,并根据C4ISR系统特性,将不同视角交错分析,观察所有可能的风险因子交互影响的关系. 该方法能够完整地发现系统开发中的风险检查点.     

液化石油气储罐区火灾危险性评价

对液化石油气罐区的危险性进行了分析,分别对蒸气云爆炸和沸腾液体扩展蒸气云爆炸类型进行了定量评价。并以某罐区为例,对其危险性进行了定量评价,并对结果进行了分析,确定了其火灾、爆炸事故的严重度、伤害范围等。实例验证了该评价方法的简单实用性,对罐区制定相应的预防措施具有参考价值。     

关于火灾模拟技术应用和发展的思考

火灾模拟技术为性能化设计提供依据和分析手段,促进了消防技术的发展。对火灾模拟技术进行了综述,介绍了火灾模拟技术在防灭火工作中的应用,对我国火灾模拟技术发展进行了展望。     

天然气管道输送工程消防设计及火灾预防对策

通过分析西气东输二线工程天然气管道输送过程的火灾危险性,从严格按规范要求进行消防设计、关键部位的火灾预防措施、检测及监控措施、消防安全管理等方面提出了消防安全防范对策。     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006