基于“任务/过程”的作战飞机寿命周期过程模型的建立

在介绍传统过程建模方法的基础上,提出了＂任务/过程＂的概念,详细分析了作战飞机寿命周期过程中任务、过程的具体含义。探讨了作战飞机＂任务/过程＂的图形化描述方法,并将其与IDEF0建模工具结合起来建立作战飞机寿命周期过程模型,详细分析了过程模型中信息的含义,有利于对作战飞机寿命周期费用进行更加有效的控制。     

基于传递闭包的任务时序依赖关系建模方法

建立正确、有效的任务模型是正确引导出信息系统需求的关键步骤。文中针对任务间时序依赖关系,给出与任务建模相关的若干形式定义和命题,帮助分析人员判断任务间的并发和死锁。给出任务间时序依赖关系建模的详细步骤,并根据时序依赖关系的传递性质,给出一种任务关系图上的传递闭包方法,可以帮助分析人员直观地判断任务间时序依赖关系的问题和错误,科学、合理地标记各个任务的时序等级属性,帮助建模人员从全局上明确各个任务在执行时所处的相对位置,以及在每个阶段需要同时展开哪些任务。     

Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty

We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

装备保障抽组力量物资装载模型

对装备保障抽组力量的物资装载问题进行了数学描述,建立了以实现全部物资尽量分散装载为目标,以同类物资集中装载、车辆承载物资总体积不超过车辆有效容积、车辆承载物资总重量不超过车辆标记载重量、物资必须装载且不被重复装载等为主要约束的数学模型,并进行了求解.最后通过实例解算验证了模型的有效性.     

对高校干部“双肩挑”模式的理性分析

高校干部"双肩挑"是目前高校普遍存在的管理模式,在高校教学科研中发挥着重要作用,是学校管理干部队伍中一支重要力量,同时又存在着不可回避的矛盾和问题。本文对"双肩挑"模式发挥的作用和存在的问题进行分析,最后有针对性的提出了几点改革对策。     

防空监视网络传感器任务优先级的模糊评价方法

传感器任务优先级是传感器管理的重要依据。应用模糊推理技术的传感器任务优先级评价方法,基于所有融合航迹和识别数据,通过符号推理确定决策循环过程中执行的每个监视任务的优先级。首先确定了管理系统结构,建立了优先级决策树,给出了模糊推理规则,最后进行了仿真试验。试验结果说明了模糊评价方法在传感器管理应用中的有效性。     

多无人机协同任务分配方法

任务分配是多UCAV协同控制的核心和有效保证,是一类复杂的多目标优化问题。针对一种扩展的混合整数线性规划(MILP)任务分配模型,通过对模型特点的分析,提出一种基于相似度的遗传退火算法解决该问题并进行仿真实验,仿真结果表明该算法具有较强的收敛性和较好的多样性,验证了改进算法解决该问题模型的有效性。     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019     

42－160柴油机离合器换向拨叉叉头优化设计的光弹验证

本文用光弹性实验方法验证了有限元法对４２—１６０柴油机离合器换向拨叉优化设计的结果。实验证明,有限元优化设计是正确、可靠的,效果是非常好的。