Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

碳纳米管场效应管尺寸缩小特性的比较

由于具有更为显著的量子隧穿效应,碳纳米管场效应管具有较硅基MOS管不同的尺寸缩小特性,同时,由于工作机理的不同,类MOS碳纳米管场效应管(C-CNFETs:Conventional MOS-like Carbon Nanotube Field Effect Transistors)的尺寸缩小特性与隧穿碳纳米管场效应管(...     

空中目标威胁评估技术

对空中目标进行威胁评估是防空C3I数据融合系统中非常重要的一个模块,威胁评估准确程度将对防空作战的结局产生重大影响。文中首先构建了威胁评估的指标体系,基于模糊隶属函数对各指标进行了量化处理。然后在分析威胁隶属度构成的向量满足比较序列的前提下,应用灰色关联度分析对空中目标进行威胁评估与排序。最后给出了一个实例,得到的结果与专家群体评议后的结果完全一致。     

自动消防系统在大型聚集场所火灾中的应用

分析大型公共聚集场所(如商场、会展中心、写字楼、公共娱乐场所等)火灾事故特点,并有针对性地说明了自动消防系统的作用,着重阐述了在火灾抢险救援中如何充分利用这些设施,以减少人员伤亡和财产损失,提高灭火成效。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

关于Smarandache序列Pd（n）和qd（n）的均值估计

对任意正整数n,Pd（n）定义为n的所有正因子的乘积,gd（n）定义为n的所有小于n的正因子的乘积。若n=p1^a1p2^a2…px^as是n的标准分解式,算数函数Ω（n）=a1＋a2＋…＋as。用解析的方法研究关于Smarandache序列Pd（n）、qd（n）与Q（n）的混合均值,并给出两个较好的渐近公式。     

面向远火面压制的阵地体系生存效能评估

为满足阵地战时毁伤规律研究需要,以阵地体系为研究对象,从系统的角度出发,探究阵地体系目标生存效能与物理毁伤的映射关系,构建阵地体系生存效能评估模型,并运用蒙特卡洛方法实现阵地目标毁伤模拟,给阵地体系目标的毁伤量化评估与防护决策提供了依据.     

子空间分解与淘汰优化方法

提出一种新的多学科设计优化方法,即子空间分解与淘汰优化方法.该方法通过子空间的分解和淘汰,提高剩余子空间的近似模型精度,基于子空间近似模型优化获取最优解.首先,基于设计空间近似模型获取最优解,如果近似模型达到满意精度,则终止优化;否则将设计空间分解为多个子空间.然后,各子空间基于近似模型优化,如果子空间没有可能获得优于...     

一种改进Van Leer格式的构造与分析

基于传统的Van Leer格式提出了一种改进的Van Leer(NVL)格式,解决了Van Leer格式在低马赫数下数值耗散过大,不能求解有粘流场等问题,同时保持Van Leer格式的计算效率.通过二维平板流动算例比较了NVL格式与传统Van Leer格式的数值耗散程度,并以NACA0012翼型的亚声速和跨声速流场以及M6机翼的跨声速流场求解为算例,与Roe格式和传统Van Leer格式进行比较,进一步验证了NVL格式的低耗散性和高效性.