Optimal division of inventory between depot and bases

We consider a problem of optimal division of stock between a logistic depot and several geographically dispersed bases, in a two‐echelon supply chain. The objective is to minimize the total cost of inventory shipment, taking into account direct shipments between the depot and the bases, and lateral transshipments between bases. We prove the convexity of the objective function and suggest a procedure for identifying the optimal solution. Small‐dimensional cases, as well as a limit case in which the number of bases tends to infinity, are solved analytically for arbitrary distributions of demand. For a general case, an approximation is suggested. We show that, in many practical cases, partial pooling is the best strategy, and large proportions of the inventory should be kept at the bases rather than at the depot. The analytical and numerical examples show that complete pooling is obtained only as a limit case in which the transshipment cost tends to infinity. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 3–18, 2017     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

一种双参数批更换系统的优化问题

研究了一种在更换时间有限的情况下 ,基于交替更新过程的双参数批更换系统的优化问题 ,这一问题的目标是平均费用率的极小化。给出了一种特殊情况的讨论结果。     

基于马尔科夫链的一种评价方法

应用了数理统计与随机过程理论,从分析动态系统的状态以及状态转移情况给出了一种合理的评价方法,经过实例验证,该方法效果较好.     

The impact of exponential smoothing forecasts on the bullwhip effect

An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two‐stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269–286, 2000     

基于马尔可夫分析的人才拥有量研究

基于马尔可夫分析理论,给出了人才拥有量预测的马尔可夫模型,并且讨论了模型中转移概率的确定及模型的预测质量等问题.     

Simultaneous production of market‐specific and global products: A two‐stage stochastic program with additional demand after recourse

This paper analyzes the simultaneous production of market‐specific products tailored to the needs of individual regions and a global product that could be sold in many regions. We assume that the global product costs more to manufacture, but allows the decision concerning the allocation of products to regions to be delayed until after the manufacturing process has been completed. We further assume that there is additional demand after the region allocation but prior to delivery, extending the two‐stage stochastic program with recourse to include additional stochastic demand after the recourse. This scenario arises, for example, when there is additional uncertainty during a delivery delay which might occur with transoceanic shipments. We develop conditions for optimality assuming a single build‐allocate‐deliver cycle and stochastic demand during both the build and deliver periods. The optimal policy calls for the simultaneous production of market‐specific and global products, even when the global product is substantially more costly than the market‐specific product. In addition, we develop bounds on the performance of the optimal policy for the multicycle problem. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 438–461, 2003     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

基于打击链的智能武器风险分析与控制方法研究

打击链是分析武器和系统等作战要素有效性的一种方法.针对当前智能武器概念缺乏一致定义的问题,本文提出了基于打击链作战方式的智能武器判定方法.针对智能武器认定困难引发的军控措施争论,分析了智能武器两方面的失控风险:人失去对自主武器的控制权与自主武器本身存在不可控因素和缺陷;以及智能武器的问责困境:如何在指挥者、编程者与智能...     

基于Petri网的指挥流程建模与优化

鉴于Petri网在企业业务流程优化与重组方面的成功运用,遂将Petri网原理应用于作战指挥流程的建模与优化,以期获得最优作战指挥流程.文中首先阐述Petri网基本原理,然后介绍指挥流程建模的Petri网模型,最后给出指挥流程优化的原则及基本模型,并利用Petri网对指挥流程进行建模和优化,结果表明Petri网理论能够明显优化作战指挥流程.提高作战指挥效率.