The cost impact of using simple forecasting techniques in a supply chain

In this paper we consider an inventory model in which the retailer does not know the exact distribution of demand and thus must use some observed demand data to forecast demand. We present an extension of the basic newsvendor model that allows us to quantify the value of the observed demand data and the impact of suboptimal forecasting on the expected costs at the retailer. We demonstrate the approach through an example in which the retailer employs a commonly used forecasting technique, exponential smoothing. The model is also used to quantify the value of information and information sharing for a decoupled supply chain in which both the retailer and the manufacturer must forecast demand. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 388–411, 2003     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

舰空导弹武器系统多弹混配的火力分配技术研究

为了解决不同防空导弹混配时的火力分配问题,在综合考虑导弹性能特点的差异以及充分发挥作战效能的前提下,建立了混配防空导弹的火力分配模型.通过基于2种舰空导弹的混合配置而建立起的攻防态势想定,对几种不同火力分配方式的作战效能进行了比较,结果表明多弹混配的火力分配模型在提高作战效能方面具有显著优越性.     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于卡尔曼滤波的反舰导弹火控数据处理

在舰载反舰导弹火控系统的数据处理中,由于量测数据受到不同程度的噪声影响,不能将得到的数据直接参与导弹射击方程的运算,必须通过对观测设备提供的数据进行卡尔曼滤波处理,为了保证获取处理数据既具有较高的精度又具有较好的稳定性,还要具有较好的时效性,因此通过采用自适应卡尔曼滤波算法,极大地提高了系统数据处理的效果,获得了较理想的反舰导弹火控系统导弹射击参数.     

一种空中目标的不确定性威胁程度预测模型

目标威胁预测是对空态势和威胁估计的重要内容.针对空中目标飞行控制的基本特点,建立了基于经验公式的空中目标不确定性位置预测模型,进一步推导了不确定性威胁概率预测的模型和实用算法.仿真结果证明了模型的有效性,可用于多类空中目标意图推理及威胁判断.     

末段高低两层协同反导火力分配模型研究

火力分配是末段高低两层反导作战的重要环节,分配方案的优劣、分配效率的高低将对反导作战效能产生重要影响。在深入分析末段协同反导作战基础上,提出了火力分配原则,并建立了末段协同反导作战火力分配模型。引入惩罚函数简化模型,并采用MPDE算法对模型进行求解。通过仿真分析,验证了模型的合理性和算法的有效性,并得出末段协同反导火力分配一般规律。