Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

移动数据库的应用研究

阐述了移动数据库的概念和特性,介绍了其应用现状及市场上存在的相关产品,分析了移动数据库在应用中要解决的关键问题,指出了其发展目标。     

扇区内插法设计虚拟均匀线列阵的研究

目前许多高分辨算法只适用于均匀线列阵的方位估计.在不规则阵列条件下,需将实际阵列等效为虚拟均匀线列阵.文中通过对基于扇区内插法设计虚拟均匀线列阵的研究,给出了设计的具体步骤,并提出一个简单且准确的虚拟线列阵阵元间隔的计算公式.     

Zadoff-Chu序列的内插算法

脉冲压缩体制斜向短波信道探测主要利用Zadoff-Chu序列良好的周期自相关特性进行相关检测。为使Zadoff-Chu序列的频谱特性与信道探测收发信机的要求相匹配,提出一种适合Zadoff-Chu序列的FDI内插算法,以改善其频谱特性,并与一般内插算法内插后的序列频谱进行比较。仿真结果表明:采用FDI内插算法插值后序列的频谱滚降更快,且几乎没有旁瓣,能量十分集中,确认了FDI内插算法的优越性;在接收端,通过理论推导给出了一种实现采用FDI算法内插后的序列最佳抽取的方法。计算和仿真结果验证了该方法的有效性。     

战场环境下无人车辆战术机动路径规划方法

针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化（Particle Swarm Optimization,PSO）方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO（BPSO）算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化（Particle Swarm Optimization based on the Multi—tasking Subpopu—lation Cooperation,PSO-MSC）算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明：该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。     

Partial equilibrium in risk‐based production decisions

Characteristically, a small subset of operational problems admit risk neutrality when contingent claims methodology were used in their analysis. That is, for the majority of manufacturing and production problems, operating cash flows are not directly linked to prices of traded assets. However, to the extent that correlations can be estimated, the methodology's applicability to a broader set of operational problems is supported. Our article addresses this issue with the objective of extending the use of contingent claims techniques to a larger set of operational problems. In broad terms, this objective entails a partial equilibrium approach to the problem of valuing uncertain cash flows. To this end, we assume risk aversion and cast our approach within Merton's intertemporal capital asset pricing model. In this context, we formulate a “generic” production valuation model that is framed as an exercise in stochastic optimal control. The model is versatile in its characterization and can easily be adapted to accommodate a wide‐ranging set of risk‐based operational problems where the underlying sources of uncertainty are not traded. To obtain results, the model is recast as a stochastic dynamic program to be solved numerically. The article addresses a number of fundamental issues in the analysis risk based decision problems in operations. First, in the approach provided, decisions are analyzed under a properly defined risk structure. Second, the process of analysis leads to suitably adjusted probability distributions through which, appropriately discounted expectations are derived. Third, through consolidating existing concepts into a standard and adaptable framework, we extend the applicability of contingent claims methodology to a broader set of operational problems. The approach is advantageous as it obviates the need for exogenously specifying utility functions or discount rates.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Optimal inventory control policy for periodic‐review inventory systems with inventory‐level‐dependent demand

We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

组网雷达的改进粒子滤波算法

针对现代战争中有源雷达容易受到干扰和反辐射导弹的摧毁,以及无源雷达隐蔽性高,只能测量方位角度,测量精度小等特点,提出利用集中式有源雷达系统与无源雷达系统协同组网对目标进行跟踪。但是在实际环境中,噪声属性以及有源雷达,无源雷达接收信号的特点决定了组网雷达需要应用非线性滤波技术对信号进行处理。传统的非线性技术包括卡尔曼滤波、扩展卡尔曼滤波(EKF)或无迹卡尔曼滤波(UKF)等方法。非线性近似过程带来的误差相对较大,而且均要求观测噪声和过程噪声为独立或相关的高斯白噪声。而粒子滤波避免了传统非线性滤波方法的缺陷,但是存在粒子退化,于是用EKF和UKF在每一时刻更新粒子,用更新的粒子及其协方差构造重要性函数,然后重采样。仿真实验表明这两种改进粒子滤波方法有很好的效果。     

作业名层次化聚类算法预测作业运行时间

预测作业的运行时间有益于提升系统的调度性能,而聚类有助于训练出更好的预测模型。传统的聚类算法很难将相似的作业名聚类,为了将相似的作业更好地聚类,通过分析其组成成分的语义重要性,构建字母-结构-数字的作业名层次化聚类算法。以两台超级计算机的真实数据为例,实验结果发现,应用此算法聚类后的数据训练模型的预测精度相较传统方法有一定的提升,整体预测精度为70%～80%。