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     

An optimal recursive method for various inventory replenishment models with increasing demand and shortages

We establish various inventory replenishment policies to solve the problem of determining the timing and number of replenishments. We then analytically compare various models, and identify the best alternative among them based on minimizing total relevant costs. Furthermore, we propose a simple and computationally efficient optimal method in a recursive fashion, and provide two examples for illustration. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 791–806, 1997     

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.     

基于群决策和QFD的型号装备作战需求论证方法

通过研究定性问题的定量化处理方法和2类关键模型,提出了基于群决策和QFD的型号装备作战需求论证方法,阐述了方法的基本流程,构建了方法应用的数学模型,在一定程度上解决了需求论证中＂定量方法不足,需求论证不清＂的难题,为型号装备立项综合论证提供了方法支撑。     

装备需求工作的发展历程

将装备需求工作的发展历程划分为4个主要阶段,详细阐述了各阶段装备需求工作活动的主要内容、方式和特点。指出正确划分装备需求工作发展历程对于认识该项工作的基本规律、完善当代的装备需求工程学科理论体系十分有益。     

Demand forecasting by temporal aggregation

Demand forecasting performance is subject to the uncertainty underlying the time series an organization is dealing with. There are many approaches that may be used to reduce uncertainty and thus to improve forecasting performance. One intuitively appealing such approach is to aggregate demand in lower‐frequency “time buckets.” The approach under concern is termed to as temporal aggregation, and in this article, we investigate its impact on forecasting performance. We assume that the nonaggregated demand follows either a moving average process of order one or a first‐order autoregressive process and a single exponential smoothing (SES) procedure is used to forecast demand. These demand processes are often encountered in practice and SES is one of the standard estimators used in industry. Theoretical mean‐squared error expressions are derived for the aggregated and nonaggregated demand to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation and experimentation with an empirical dataset. The results indicate that performance improvements achieved through the aggregation approach are a function of the aggregation level, the smoothing constant, and the process parameters. Valuable insights are offered to practitioners and the article closes with an agenda for further research in this area. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 479–498, 2013     

Some aspects in estimating warranty and post‐warranty repair demands

When customers buy a product, they are often eligible for free repairs for a certain warranty period. In this article, we study some important aspects, which are often overlooked in the literature but are of interest to the manufacturer, in estimating both warranty and post‐warranty repair demands. We consider that the installed base of the product (i.e., the number of units of the product actually in use) varies with time due to both new sales and units being taken out of service. When estimating warranty and post‐warranty repair demands, we explicitly address the fact that customers may not always request repairs for failed units. For the case where the product failure time distribution is exponential, we derive the closed‐form expressions for both types of repair demands of a single unit and of the time‐varying installed base. The insights into some risk‐related quantities are also presented. Furthermore, the proposed model is extended by considering delayed warranty claims that are frequently seen in practice. Numerical examples illustrate that understanding both types of repair demands and the related decision variables is important for managing the obligatory and profitable repair services. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 499–511, 2013     

面向需求变化的军队自动化立体仓库货位优化

为提高军队自动化立体仓库的出库能力,提出应根据需求变化对在库物资货位进行动态调整,从而最大限度地保障军队物资需求。综合考虑堆垛机总行程、货物离散度和出库频率等评价指标,采用遗传算法对该多目标优化问题进行求解,并运用Matalab仿真。结果表明,该方法能较好地提高军队自动化立体仓库在需求动态变化时的出库能力。同时,该研究对一般仓库的货位优化也有一定的借鉴意义。     

基于备件需求预测的两步法理论

在对备件需求时间序列研究的基础上,结合指数平滑法和Croston法的特点,分析了指数平滑法与两步法的原理,通过对指数平滑法和两步法方差的研究,得到两步法是指数平滑法的一般形式的结论,为两步法的进一步研究提供一定的理论支撑。     

联合火力打击弹药需求计算动态模型研究

弹药是火力打击和火力毁伤的基础.传统的火力毁伤弹药需求计算主要有两种思路,一种是不考虑对抗,单纯基于目标的幅员和弹药的毁伤概率静态计算弹药的需求,一种是考虑对抗,运用兰切斯特方程计算弹药的消耗,这样求得的预测结果与实际需求均有较大的差距.研究发现,将基于目标打击的弹药需求和在对抗条件下武器损耗因素结合起来考虑,可以有机地将两种弹药消耗的计算思路融合在一起,建立新的数学模型,所得结果反映了弹药实际需求与外部因素的内在关系,与实际作战更加相符,对战时的弹药供应决策具有重要意义.