基于SPN有限等待差错服务的火力单元排队模型

给出了一般排队模型的SPN描述,分析了防空火力单元的实际作战过程,在已有的火力单元的模型基础上,提出了有限等待差错服务的排队模型,详细分析了排队模型的运行机制,包括顾客有限等待、优先级的排队等,最后运用SPN理论对应的联系谓词公式和随机开关对模型进行了强有力的描述。是构建防空战役层面大型排队网络模型的基础。     

低温推进剂供应管道系统充填过程的动力学模型

研究了低温推进剂液体火箭发动机供应管道系统充填过程的建模问题。低温推进剂的充填相变过程采用均相模型,对推进剂充填管道系统进行有限元分割,应用基本守恒定律于充满推进剂的单元和充满气体的单元,两相单元采用等效流容方程,建立了低温推进剂管道充填过程的有限元状态变量模型。充填的容腔视为两相单元,建立了其动力学模型。利用本文的模型,对液氢、液氧推进剂的管道充填过程进行了仿真计算,给出了有关计算结果。     

潜艇电力推进装置的动态模型辨识

将系统辨识的方法应用到潜艇电力推进系统的动态特性的分析中 ,辨识算法采用递推增广矩阵法(RELS) ,并采用变遗忘因子 ,以改善系统的跟踪性能 .研究对象为一模拟电力推进机组 ,在实验数据的基础上建立了该系统励磁控制下的动态模型 .     

AR模型在陀螺仪性能故障诊断中的应用研究

对惯导系统上的陀螺仪在无故障和故障下输出的信号进行分析 ,计算出信号的特征量———均值、标准差、协方差 ,并用现代谱分析技术中参数模型功率谱分析的方法 ,建立信号的AR模型、绘出AR模型的功率谱图 ,对陀螺仪输出信号的变化进行了比较和分析 ,从而找出一种作为判断陀螺仪性能故障的依据     

最小交互熵谱估计在反坦克导弹系统仿真模型验证中的应用

针对反坦克导弹系统动态过程仿真的输出具有短时序、低信噪比的特点 ,研究了应用最小交互熵谱估计验证导弹系统仿真模型有效性的方法 ,并结合某型号滚转稳定的反坦克导弹系统的仿真数据和理论计算数据给出了最小交互熵谱估计的应用结果。     

弹药保障决策模型的研究

从弹药保障的工作入手 ,论述了弹药消耗预计算法 ,提出了基于存储论的弹药补充决策模型。给出了战时弹药保障的 3种策略     

CAPP系统中工艺表格自动生成技术研究

针对企业应用CAPP的需要 ,研制成功了工艺表格自动生成系统。该系统建立一个处理工艺表格的通用模型 ,把企业的具体工艺表格当作模型的实例 ,并将工艺表格的形式和要求等作为实例的属性。系统采用ODBC(开放式数据库互连 )技术 ,为MIS、PDM等系统内部不同模式数据交换提供接口。实践证明系统具有设计方法新颖、通用性强和实用性好等特点。     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001