Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

椭圆弹道射程角和飞行时间公式的一种推导方法

本文利用椭圆弹道长轴方向有一常量的性质,计算了被动段弹道的射程和飞行时间。     

测量TOA和DOA的单站无源定位跟踪可观测条件

单站无源定位跟踪技术中,可观测性分析是一个关键问题,但是由于TOA测量方程的非线性程度太高,直接通过计算Jacobin矩阵得到的可观测矩阵形式非常复杂,很难得出明确的分析结果。采用新的思路推导了一种TOA测量方程的线性化方程,分析了测量TOA和DOA单站无源定位的可观测条件。最后给出了计算机仿真结果。     

基于D-S理论的多传感器空中目标识别

针对当前空中目标识别的特点,探讨基于D-S理论的多传感器空中目标识别方法.设计了一套多传感器空中目标识别算法.详细推导了该算法,对"未知度"的概念进行了扩充,让其涵盖了部分不可求的逆命题,并结合具体实例对其应用进行了验证和分析.分析表明,该算法能够较好地识别空中目标.灵活确定"未知度",适当扩充"未知度"的概念,可使一些复杂问题简单化,通过较少地运算达到预定效果.     

Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

树状军事通信网中的文件传输优化算法

针对树状军事通信网中的文件传输优化问题,提出了一种有效的寻找最优的树图边着色算法,该算法保证了边着色后的树图中"延迟损耗"总和最小,并由求取最小"延迟损耗"的反向推导过程得到最优的树状通信网文件传输方案.算法的计算复杂度是,其中为顶点数,为树的最大度.     

通用计算机实时仿真技术

通用计算机由于各种相互兼容的标准硬件及丰富的应用软件支持而获得了广泛的应用,但通用计算机往往运行多任务的操作系统,这种通用操作系统一般不能满足半实物仿真的实时性要求。讨论了通用计算机半实物仿真的实时时钟获取方法,重点研究了通用操作系统的帧时间不稳定问题。提出了保证实时仿真帧时间的几种方法,并建立了一个具体的通用仿真计算机系统。试验结果表明,基于通用计算机的实时仿真是可行的。     

二阶中立型含逐段常滞量微分方程的伪概周期解的存在性

讨论下列中立型含逐段常滞量微分方程的伪概周期解d2dt2(x(t)+p(t)x(t-1))=qx(2[t+12])+g(t,x(t),x[t])采用不动点定理和构造伪概周期序列的方法,得到了此方程的伪概周期解的存在性,并推广了文献[5～8]中的有关结果。     

基于PIC系列单片机的迫弹电子时间引信控制系统设计

介绍了迫弹电子时间引信控制系统的电路组成、工作原理及其功能,并以PIC16F873A型单片机作为控制器核心,对引信的工作过程进行控制,提高了引信的安全性和可靠性。     

基于粗集的神经网络在目标类型识别中的研究

为克服传统的目标类型识别方法的不足,提出将粗集和神经网络紧耦合建立新的识别模型,即经过识别信息预处理、样本数据粗集方法简化、神经网络学习训练及待识信息网络识别等步骤,充分融合了粗集强大的规则提取能力和神经网络优良的分类能力。实验表明,该模型减少了识别的主观因素,简化了神经网络结构,提高了运算速度。