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.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Predictability of operational processes over finite horizon

Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Inventory control in divergent supply chains with time‐based dispatching and shipment consolidation

This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011     

FFT-MTD滤波器组优化设计与仿真

介绍了用FFT算法实现雷达信号动目标检测(MTD)的方法,为提升MTD在强杂波环境下的检测性能,对加权FFT优化MTD时窗函数的选取进行了讨论,比较了6种窗函数加权时FFT等效多普勒滤波器组的幅频特性和改善因子,得出了适合于MTD的最佳窗函数,并针对某型雷达信号体制进行了仿真分析和验证,结果表明优化方法增强了MTD在杂波背景下的检测性能.     

基于SPSO的考虑指控节点受攻击的WTA问题优化方法

鉴于网络中心战中指挥所的重要性,根据实际作战原则,通过对传统武器目标分配(WTA)模型的分析,建立了考虑指控节点受攻击的武器目标分配(Weapon-Target Assignment with Vulnerable Command and Control Nodes,WTAVC2N)模型,并利用随机PSO算法对该模型进行仿真验证。仿真结果表明了利用随机PSO算法解决考虑指挥所被摧毁的武器目标分配问题的有效性及合理性。     

Fashion products with asymmetric sales horizons

In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于响应平面法的压力容器可靠性评定

针对压力容器制造、使用过程中各种参数的不确定性,提出了一种基于响应平面的随机分析方法.根据某压力容器的结构特点,确定性有限元分析采用了接触有限元,结合中心组合抽样设计构建了容器最大应力的响应平面,以此为基础对压力容器应力分布进行了随机分析.可靠性分析中引入应力—强度干涉模型,并分别对容器壁面和接管处进行了可靠性评定.实...     

基于混沌特征的高分辨雷达目标识别

根据高分辨导弹制导雷达的基本工作原则和舰船目标的散射特性,利用现有雷达回波的仿真技术,在合理的战术想定下,计算了三类典型舰船的雷达回波.在此基础上,研究了利用雷达回波功率谱的方法来识别目标类型的有效性,并基于混沌理论提出了一种比功率谱方法更加有效的新的识别方法,从而为进一步利用混沌理论来开发雷达目标识别技术奠定了初步的理论基础.     

小波分析在雷达信号处理中的应用展望

小波分析在雷达信号处理中的应用研究,已成为近些年来信号处理学科的热点之一。介绍了小波分析的发展历史、研究现状,阐明了小波分析的基本概念,比较了各种小波处理方法的特点,详细讨论了小波在雷达信号处理中的诸多应用,指出了有待解决的各种问题,对小波分析在雷达信号处理中的应用提出了展望。