Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

马尔科夫对称离散信道级联信道容量研究

基于有限维的级联马尔科夫对称信道矩阵,其转移概率的极限一定存在,推导出当n足够大时,输出符号的概率分布不依赖于输入的概率分布,使得信道容量为零,信道阻塞。n为信道级联的上限。针对主对角元素概率值不同将信道矩阵划分为惰性信道和灵敏信道,并通过仿真分析得出信道的级联上限n与矩阵维数无关,与信道矩阵主对角元素呈正相关。     

信息化条件下装备器材供应链设计与重构研究

现行装备器材供应存在着供应渠道过长、不能快速响应等问题,为此通过对装备器材供应链进行集成化体系结构模型设计与构建,探讨了装备器材供应链的重构策略,分别从信息流模式重构、业务流程重构和物流体系重构等3个主要方面对装备器材供应链重构策略进行了分析与探讨,以实现装备器材供应链的快速响应.     

THE MORAL PERMISSIBILITY OF AUTOMATED RESPONSES DURING CYBERWARFARE

Automated responses are an inevitable aspect of cyberwarfare, but there has not been a systematic treatment of the conditions in which they are morally permissible. We argue that there are three substantial barriers to the moral permissibility of an automated response: the attribution, chain reaction, and projection bias problems. Moreover, these three challenges together provide a set of operational tests that can be used to assess the moral permissibility of a particular automated response in a specific situation. Defensive automated responses will almost always pass all three challenges, while offensive automated responses typically face a substantial positive burden in order to overcome the chain reaction and projection bias challenges. Perhaps the most interesting cases arise in the middle ground between cyber-offense and cyber-defense, such as automated cyber-exploitation responses. In those situations, much depends on the finer details of the response, the context, and the adversary. Importantly, however, the operationalizations of the three challenges provide a clear guide for decision-makers to assess the moral permissibility of automated responses that could potentially be implemented.     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Coordination mechanisms for a three‐stage reverse supply chain to increase profitable returns

In this article, we consider a generic electronic product that can be remanufactured or recycled at the end of its life cycle to generate new profit. We first describe the product return process and then present a customer segmentation model to capture consumers' different behaviors with respect to product return so that the retailer can work more effectively to increase the return volume. In regard to the collaboration between the retailer and the manufacturer, we explore a revenue‐sharing coordination mechanism for achieving a win‐win outcome. The optimality and sensitivity of the critical parameters in four strategies are obtained and examined both theoretically and numerically, which generate insights on how to manage an efficient consumer‐retailer‐manufacturer reverse supply chain, as well as on the feasibility of simplifying such a three‐stage chain structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种用于雷达网目标状态融合的算法

针对目前雷达情报自动化系统中雷达网目标状态融合存在航迹不连续、情报信息利用率低等问题,综合运用了神经网络和军事运筹学理论和方法,给出了一种用于雷达网目标状态融合的算法.结果表明,利用本方法使融合后的目标轨迹与目标真实运动轨迹非常接近,有效地提高了雷达情报的综合质量.     

多层弹道导弹防御体系射击策略研究

主要利用离散马尔可夫链(DTMC)对多层弹道导弹防御系统反导作战射击策略问题进行了研究.定义了多层弹道导弹防御体系防御层识别矩阵、拦截矩阵、综合防御能力矩阵等描述多层弹道导弹防御体系防御层作战能力的相关概念,建立了多层弹道导弹防御体系的DTMC模型.在此基础上,应用多层弹道导弹防御体系的DTMC模型对多层弹道导弹防御体系射击策略对作战效能的影响进行了预测分析,最后应用实例验证了模型的有效性及实用性.研究结果可为制定多层弹道导弹防御体系射击策略问题提供决策依据.     

基于模糊Petri网的航材供应链冲突诊断建模与分析

结合航材供应链特点,建立航材供应链冲突诊断指标体系,并将节点问协作指标引入体系之中。通过模糊产生式规则,建立航材供应链冲突诊断模型,进行诊断推理,找出引起冲突的关键因素,并提出航材供应链冲突的防范对策。     

基于SD的弹药供应链系统稳定性分析

为了研究弹药供应链系统的稳定性,基于弹药供应链系统的组成进行分析,采用系统动力学方法建立了二阶弹药供应链系统的稳定性模型,并利用系统动力学专用软件Vensim对该模型进行数学建模与仿真实验,得到系统稳定、出现震荡及溢出现象时相关参数的取值范围。仿真结果表明：影响弹药供应链系统稳定性的因素是弹药库订货决策的参数,与外部需求无关。