Optimal material control in an assembly system with component commonality

Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001     

The NBUL class of life distribution and replacement policy comparisons

Let X and X_τ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if X_τ is smaller than X in Laplace order, i.e., X_τ ≤_L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001.     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Applying a bootstrap approach for setting reorder points in military supply systems

This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000     

战术导弹连射试验测控软件关键技术

针对导弹的多发连射试验,在单发导弹飞行试验实时测控软件系统的基础上,研究了I/O缓冲设置、多发射信号的接收与识别、第n发导弹数据处理时机等关键技术.解决了研发用于战术导弹连射试验测控软件系统中的多项难题,使得靶场实时测控软件系统能够满足多发导弹连射试验的航区安全控制需要.     

军事软毁伤效应综合评估与决策分析

军事打击不但可以直接毁伤敌方政治、军事目标,而且可以造成敌方社会秩序混乱、经济发展受挫、人民心理恐慌等军事软毁伤效应。军事软毁伤效应在未来信息化战争中很有可能达成显著的战略目标,因此,研究军事软毁伤效应具有重要而现实的意义。依据软毁伤理论,建立了军事软毁伤效应的综合评估指标体系,给出了一种军事软毁伤效应的综合评估模型,并设计了综合评估决策支持系统。     

通用计算机实时仿真技术

通用计算机由于各种相互兼容的标准硬件及丰富的应用软件支持而获得了广泛的应用,但通用计算机往往运行多任务的操作系统,这种通用操作系统一般不能满足半实物仿真的实时性要求。讨论了通用计算机半实物仿真的实时时钟获取方法,重点研究了通用操作系统的帧时间不稳定问题。提出了保证实时仿真帧时间的几种方法,并建立了一个具体的通用仿真计算机系统。试验结果表明,基于通用计算机的实时仿真是可行的。     

液体火箭发动机涡轮泵健康监控系统

为了提高液体火箭发动机涡轮泵的安全性,降低其故障带来的破坏性,设计了某型液体火箭发动机涡轮泵健康监控系统(TP HMS),工程实现了TP HMS的测试硬件子系统、实时故障检测子系统、试车后数据分析子系统和实时数据库支持子系统等,讨论和分析了TP HMS的功能和执行流程,然后利用历史试车数据与转子试验平台数据对TP HMS中的多特征参量自适应阈值综合决策算法(MATA)进行了离线和实时在线验证;利用自适应时频谱对测试数据作进一步的分析。结果表明,MATA没有发生误检测情况,并具有实时故障检测的能力;自适应时频谱能有效抑制时频交叉项的干扰,准确给出故障信号的时间和频率信息。因此,TP HMS适合于液体火箭发动机涡轮泵健康状态监控。     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A continuous‐time strategic capacity planning model

Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.