On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

一种长周期伪码信号的跳跃式扩展重叠捕获方法

随着直扩技术的发展,为提高应用系统的信号质量,出现了长周期伪码信号。然而,正是由于长周期伪码的出现及广泛应用,引发了系统接收的同步搜索误差大、速度慢等关键问题。为此,针对长周期伪码特性,考虑现有方法的局限和不足,提出了一种跳跃式扩展重叠捕获方法,通过扩展分段的跳跃式重叠技术来扩大搜索范围及提高处理速度。仿真结果表明,新方法在捕获性能及处理速度、检测概率等方面都明显优于现有的方法。此研究可以为扩频信号的高效同步及系统应用提供技术基础。     

基于节点综合效能的DTN路由算法

针对容忍延迟网络(DTN)高延迟、数据传输成功率低等问题,提出了一种基于节点综合效能的DTN路由算法SERA。该算法综合考虑移动节点的活跃度和剩余能量,使消息副本向综合效能高的节点扩散。SERA节点活跃度描述了节点的社会和动态特性,SERA尽量将消息副本传递给活跃度高的节点,以提高消息传输的成功率;在选择中继节点时,充分考虑节点的能量状态,以避免能量不足的节点承担更多的信息传输任务,从而提高网络节点的存活率。仿真结果表明,与典型的DTN路由算法相比,SERA能够更好地平衡节点的能耗,获得更高的消息递交成功率和更长的网络生存期。     

自适应数据融合算法

以防空导弹指控系统作战单位为背景,通过对现有经典算法及工程化算法的分析,结合专家经验,提出了基于算法间联系的工程化自适应数据融合算法.对自适应算法的思想、规则集、算法库、推理组成和算法的实现作了详细的描述.     

核动力装置热工水力运行分析程序中的堆芯物理模型

提出了一套用于微机版船用核动力装置热工水力运行分析程序的堆芯物理模型 ,该模型既能较逼真地描述实际的物理过程 ,又能满足运行实时性要求和运行监督所要求的计算精度     

电液伺服系统的仿真与自校正PID控制器的设计

对一个试验用电液伺服系统进行了理论建模和仿真研究 ,引入了一个非线性状态方程模型来描述电液伺服系统的动态特性 .通过仿真结果与实际系统的响应相比较 ,验证了所建立的理论模型的准确性 .在此仿真模型基础上 ,设计了一个适用的自校正PID控制器 ,并且对其控制特性进行了仿真研究     

Scheduling stochastic jobs with asymmetric earliness and tardiness penalties

We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997.     

自行高炮惯导精度对空情融合影响的仿真分析

为说明惯性测量元件、测量精度与自行高炮武器系统空情信息融合精度指标之间的关系,在分析自行高炮武器系统探测坐标之间的转换关系、空情共享交互方式以及空情信息融合误差源的基础上,给出了影响空情信息融合精度指标的因素;通过两种精度的惯性测量元件在纯惯导方式和惯导/卫星组合方式下对信息融合精度的影响计算分析,给出了不同条件下的误...     

Optimal policies for stochastic clearing systems with time-dependent delay penalties

We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.     

电子防空协同下多层火力拦截巡航导弹能力研究

从电子防空和火力拦截两个方面分析了抗袭巡航导弹的基本对策,采用排队论方法构建了"软硬杀伤拦截"的效能模型,并计算出固定部署防空体系的拦截效率。结合算例证明了模型的实用性,通过对比得出在有电子防空协同下拦截巡航导弹时的可行性与优势。