Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

ATIE:一种自适应的可调域间出口选择算法

TIE算法能对域间出口的选择进行调节,但是该算法的参数计算过于复杂,并且出口选择的调节并不能随负载的变化而变化,因此提出了一种自适应的可调域间出口选择算法ATIE,该算法能够满足流量工程和网络健壮性要求,并通过参数T的改变随当前负载的变化而变化.实验表明,ATIE算法能够在控制剖面敏感性和随负载变化的流量工程自适应性上达到合理的折衷.     

火箭弹防静电短路卡抗静电性能实验研究

通过实验研究了火箭弹系统在安装防静电短路卡前后静态电阻的变化 ,提出了利用脉冲电流发生器测定安装防静电短路卡后系统动态电阻的方法。研究表明 ,安装防静电短路卡后 ,系统动态电阻很小 (小于30mΩ) ,火箭弹抗静电性能明显提高     

行星变速箱换档过程动态仿真研究

从传动系行星排传递单元和构件出发,建立了N自由度行星变速箱运动学数学模型,并运用该模型对三自由度行星变速箱进行了换档过程的动态仿真。     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

多芯片焊球阵列封装体受热载荷作用数值模拟

针对典型高密度多芯片BGA(焊球阵列)封装体建立三维有限元分析模型,研究不同尺寸封装体在稳态热载荷作用下的结构变形和应力情况,在此基础上引入包含等效梁和危险焊球真实几何形状和间距等在内的简化模型以进行序列分析,研究各设计参数对力学参量的影响。数值结果反映了封装体应力分布及其变化特点,表明影响封装体变形和应力的主要参数;提出的建模方法简便有效,可以方便地用来分析不同类型的BGA封装,并扩展应用至不同的分析目的,为此种结构的设计和优化提供一定参考。     

矩阵外积法Kalman滤波器在动态GPS定位中的应用

由于计算机有效字长的限制,滤波算法在计算机上实施时易于产生误差积累,误差协方差失去正定性或对称性,从而出现数值计算中的不稳定现象.一般情况下,当状态变量维数超过10时,滤波过程中出现滤波结果不稳定现象概率增大.为了解决滤波器数值计算不稳定问题,实践中提出并应用了许多方法,如自适应滤波、固定增益滤波、平方根滤波等.这些算法的不足是计算繁琐,效率低下.提出一个基于矩阵外积法所设计的快速、稳定的滤波算法,该卡尔曼滤波算法速度快,效率高,数值稳定性好,运算量少,将其应用于动态GPS定位验证了其有效性.     

多量子阱红外焦平面阵列研制进展

研制红外凝视成像导引头的一项关键技术,是要制造大面积的性能均匀的红外焦平面阵列。近年来,从能带工程的观点出发,使用以现代薄膜技术制造的多量子阱超晶格材料,采用微电子技术研制的多量子阱红外焦平面阵列的工作进展很快,备受人们关注。了解有关的发展背景、基本原理、先进技术和研制实例是十分有益的。     

大口径顶置火炮输弹机动力学研究

为解决大口径顶置火炮弹药自动装填系统的关键技术问题,提出了大口径顶置火炮输弹机各工作阶段的力学模型和动力学方程,并通过输弹速度与时间的计算分析,得到了3种输弹方式的输弹速度与时间关系曲线,其结果对大口径顶置火炮供输弹系统的研究具有较大参考价值。