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     

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

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

修正的交互加速度补偿机动目标跟踪算法

为了提高交互加速度补偿算法(IAC)的滤波精度,通过引入一个改进因子自适应地调整过程噪声协方差,给出了一种新的算法.在给定的初始条件下,通过蒙特卡罗仿真,将修正的IAC算法与IAC算法进行比较,结果表明修正的交互加速度补偿算法在目标发生机动时具有更好的跟踪性能.     

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     

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

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

二相编码雷达前沿复制干扰的能量效率分析

针对提高干扰的能量利用效率提供一些理论和技术问题,介绍了前沿复制干扰的产生背景。对二相编码雷达、灵巧噪声干扰和前沿复制干扰的基本成分通过匹配滤波器后的输出信号脉冲峰值进行了分析。以在匹配滤波器输出端产生相同数量和相同幅度大小的脉冲为能量利用效率比较基准,给出了这两种干扰方式各自所需的干扰信号能量的计算公式,并进行了典型条件下,这两种干扰方式所需干扰信号能量的数值计算;在一般情况下,对这两种干扰方式的能量利用效率进行了比较。指出若前沿波形宽度为雷达发射信号宽度的1/n,则前沿复制干扰所需能量为灵巧噪声干扰所需能量的n倍,前沿复制干扰的能量利用效率仅为灵巧噪声干扰的能量利用效率的1/n。     

m序列二相编码雷达灵巧噪声干扰研究

针对前沿复制干扰能量利用效率低的问题,提出了利用前沿波形,通过预测,超前获取雷达信号完整波形,进而实施灵巧噪声干扰的思路。对于采用由n级移位寄存器产生的m序列的二相编码雷达,给出了利用获得的前2n个码元,通过解n元线性方程组,预测获得完整m序列的方法。进一步,针对该线性方程组的生成特点,提出了一种快速算法。利用该快速算法,可以将预测的计算工作量平均分配到从获得m序列的第n＋1个码元到获得第2n个码元的各个节拍中去,使得一旦获得m序列的第2n个码元,就能够立刻得到m序列的所有反馈系数,获取雷达的当前发射信号的完整波形,并以最短的延迟实施针对性的灵巧噪声干扰。     

6.3GHz反馈型介质谐振器振荡器的设计与实现

文章设计了一种场效应管源极输出的并联反馈型C波段介质谐振器振荡器,较详细地讨论了该结构的设计和仿真方法,即利用HFSS电磁仿真软件与ADS电路仿真软件联合仿真的方法,对介质谐振器振荡器性能进行了优化设计和仿真,并采用单管GaAs FET实现了输出频率为6.3 GHz的介质谐振器振荡器,得到了较满意地测试结果,其输出功率大于5 dBm,相位噪声为-94 dBc/Hz@10 kHz、-120 dBc/Hz@100 kHz。