双时间隐式方法求解非定常绕流的相关问题

空间采用三阶精度的WeightedNND(WNND)格式,时间方向则采用具有二阶精度的双时间步隐式方法求解二维非定常Euler方程,数值模拟了NACA0012翼型俯仰强迫振动流场,讨论了内迭代步数、内迭代收敛判据以及物理时间步长对计算结果、计算效率与计算CPU时间的影响,并将计算结果与实验值进行了比较。     

装甲车辆动力传动系统整体性工程初探

全面考虑装甲车辆动力传动系统论证、研制、生产及使用等方面的因素,从整体、系统和全局的观点出发,论述了装甲车辆动力传动系统的整体式设计、一体化控制、性能综合评价和寿命周期费用分析.从而把装甲车辆动力传动系统的论证、研制、生产及使用看作一个整体性工程来考虑,克服了以往设计和使用中重点突出某一过程或部件,而忽略相互匹配和顾此失彼的问题,为在现有技术基础上进一步提高装甲车辆的机动性能,提供了一种新的研究思路.     

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.     

坦克动力舱空气流动计算区域的网格生成

为了合理解决网格划分对坦克动力舱空气流动与传热三维数值计算效率和计算精度的影响,特提出动力舱空气流动计算区域的网格生成方法.对某型坦克动力舱的网格生成实例,显示了这种方法的实用性.     

反导作战指控系统信息流时延模型研究与应用

在现代反导作战中,如何规划反导作战指控系统从而缩短目标、指挥信息传输时间和提高指挥精度是很重要的问题。基于此展开讨论,首先设计规划了3种反导作战指控系统信息流时延模型并提出了应用原则,其次分别以一典型3 500 km TBM和不同射程TBM为例进行了时延模型仿真计算和分析,最后通过分析计算结果给出反导作战指控系统建设性结论。     

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