机载相控阵雷达搜索模式辐射能量控制方法

机载相控阵雷达过高的辐射能量威胁了战斗机的生存能力。为了减少相控阵雷达搜索模式辐射能量,提出了基于辐射能量控制的搜索模型。将总能量消耗函数和检测概率相对误差作为目标函数,以平均功率、波束宽度、积累脉冲数以及脉冲重复间隔作为优化变量,选取非支配遗传排序算法对此模型进行优化。仿真结果表明,在同样检测概率情况下,提出的搜索方法可以有效控制雷达辐射能量,具有更好的射频隐身性能。     

基于SDP松弛的干扰资源优化分配技术研究

提出一种基于semidefinite programming(简称SDP)松弛的干扰资源优化分配算法。在问题优化过程中首先对模型中非凸的约束条件进行松弛,变为凸约束,将原来的数学模型转化成SDP求解形式,利用内点算法对松弛后的模型求解。该算法利用解析的手段使得干扰资源优化分配问题中的NP难问题在多项式时间内得以解决,并且有较高的可靠性。仿真结果验证了算法的有效性。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

基于正交锁定差分放大器的巨磁阻抗（GMI）磁传感器

基于非晶丝的巨磁阻抗(GMI)效应,利用CoFeBSi非晶丝作为敏感材料,采用正交锁定放大电路和仪用放大器作为信号调理电路,设计了一种差分式高灵敏度GMI磁传感器。介绍了巨磁阻抗效应的基本概念和双非晶丝差分结构的磁敏探头,分析了基于正交锁定差分放大技术的信号调理电路的工作原理,并结合非晶丝两端输出信号的幅度和相位特性,提出了正交锁定放大器输出包络的近似计算方法。实验结果表明:在-2.0 Oe~+2.0 Oe的量程内,该GMI磁传感器灵敏度可达748mV/Oe,线性误差为0.98%FS,且噪声平均功率谱密度约为0.8nT/Hz1/2。     

卫星导航系统的体系安全性分析方法

为了应对卫星导航系统内部复杂关系等体系特征为其安全分析带来的挑战、全面识别和分析卫星导航系统面临的体系安全威胁、提高系统的安全性和服务能力,基于功能依赖网络分析理论提出了从体系角度研究卫星导航系统安全性的建模方法,重点对导航系统内组件系统之间交互关系导致的危险传播、任意失效组合进行了后果分析和原因调查。仿真结果表明该方法能清晰地描述危险传播和失效组合的过程以及进行正逆向的推理分析,也证明了该方法在卫星导航系统安全分析问题上的潜力和适用性。     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.