Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种新的复合导引头多源异步信息融合精确拦截算法

针对单一制导体制难以满足现代战场作战需求，而多传感器数据更新率不同步的问题，建立一种新的微惯导/毫米波/红外复合制导体制，研究了该体制下多传感器异步信息融合的时间同步和空间配准问题；提出一种自适应Unscented卡尔曼滤波算法，该算法采用预测残差构造状态模型误差统计量，通过自适应因子调整状态模型信息对状态参数估值的贡献，有效控制状态模型噪声异常对状态参数估值的影响。将提出的算法应用到微惯导/毫米波/红外复合制导系统中进行仿真验证，结果表明，提出的自适应Unscented卡尔曼滤波算法的解算精度高于标准扩展卡尔曼滤波和Unscented卡尔曼滤波算法，能有效提高导弹的制导的解算精度。     

一种基于多目标优化的QoS路由交互式算法

为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性     

光学晶体K2Al2B2O7相位匹配参量放大研究

对K2Al2B2O7（KABO）晶体的相位匹配飞秒激光参量放大（OPA）特性进行了系统的理论计算和分析。分别讨论了Ⅰ型、Ⅱ型参量放大共线以及非共线情况，计算了在不同非共线夹角下的相位匹配角度。研究结果表明：对于一定波长的抽运光，存在一定的非共线入射角对应一定波长的信号光。在KABOⅠ型参变条件下，非共线角的引入使相位匹配角增大。这对于高效率地产生脉宽极短的飞秒参量激光、扩大飞秒激光的调谐范围以及通过参量技术放大飞秒脉冲都具有重要的意义。     

Optimal job splitting on a multi‐slot machine with applications in the printing industry

In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

多部雷达的目标定位问题研究

现代空袭环境越来越复杂,一般部署多部雷达进行空情搜索。研究了多部雷达的目标定位问题,探讨了使残差的平方和为最小、使残差的最大绝对值为最小和使残差的绝对值之和为最小三个准则,并给出了相应的数学模型,用Matlab优化工具箱进行了计算。     

复合导引头多源异步信息融合精确拦截算法

针对单一制导体制难以满足现代战场作战需求且多传感器数据更新率不同步的问题,建立一种新的微惯导/毫米波/红外复合制导体制,研究了该体制下多传感器异步信息融合的时间同步和空间配准问题;提出一种自适应无迹卡尔曼滤波算法,该算法采用预测残差构造状态模型误差统计量,通过自适应因子调整状态模型信息对状态参数估值的贡献,有效控制状态模型噪声异常对状态参数估值的影响。将提出的算法应用到微惯导/毫米波/红外复合制导系统中进行仿真验证,结果表明,提出的自适应无迹卡尔曼滤波算法的解算精度高于标准扩展卡尔曼滤波和无迹卡尔曼滤波算法,能有效提高导弹的制导的解算精度。     

疲劳裂纹闭合的非线性超声在线测量

建立了外部载荷作用下用非线性振动-声场调制指数表征裂纹尺寸的数学模型。根据对外载荷与塑性致闭应力共同作用下裂纹面的开闭响应的分析,提出了裂纹张开和闭合应力的在线测量方法。在一块含中心穿透裂纹的铝合金薄板试件上进行了裂纹闭合参数的测量实验,实验结果表明,使用振动-声场调制技术在线测量裂纹闭合参数是可行且有效的,且该方法还能用于分析小裂纹的特殊开闭行为。     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011