Robust capacity planning in semiconductor manufacturing

We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

石化企业设置火灾事故应急水池的必要性及容量计算

简要阐述了石化企业设置火灾事故情况下事故应急水池的必要性,并对事故应急水池的计算方法进行分析,最后结合工程实例进行容量计算,对同类的设计提供一定的参考。     

一种基于循环谱的数字信号调制识别方法

文章基于循环平稳信号处理理论,利用数字通信信号的循环谱特征的不同提出四个特征参数,用于信号调制识别。提取的参数较少,计算量较高阶循环累积量小。给出了三类信号调制方式自动识别算法的实现流程,该识别算法以统计理论为基础,不要求实现载波同步。仿真结果表明,在信噪比RSN≥5 dB时,算法的平均识别成功率>96%。     

基于超宽带（UWB）技术的战车通信探讨

超宽带技术是目前国内外研究的重要课题,特别在军事通信领域具有广阔的应用前景。通过论述战车通信的发展趋势,超宽带技术的特点,对超宽带技术在战车通信上的应用进行了探讨,并分析了存在的问题。     

基于神经网络的舰船目标识别研究

为了实现对水下目标的识别,在现有特征提取方法的基础上,提出了一种从DEMON谱线谱和DEMON谱连续谱提取的特征方法,并设计了一个基于BP神经网络和多神经网络分类识别器的舰船目标识别系统。通过对实际舰船噪声目标进行识别,识别效果比较满意。这对舰船目标识别的发展具有一定的参考价值。     

反辐射无人机在电子战中的应用及其效能分析

简要讨论了反辐射无人机系统的组成和两种典型的反辐射无人机,指出了其在电子战中的应用。并针对某型反辐射无人机的系统能力,即命中概率和毁伤概率进行了理论分析和计算。     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

新型钢-混凝土组合板的力学性能研究

以加劲肋形式、组合板厚度和栓钉布置为参数,进行了9块新型组合板的力学性能试验.试验结果表明,组合板的正截面承载力可按基于修正平截面假定的极限状态计算;组合板的跨中挠度,可在按现行规范计算的基础上,加上考虑界面滑移影响的附加变形值予以修正.     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006