AHP法在舰空导弹作战通道分析中的应用

层次分析法(AHP)是一种简便、灵活而又实用的多准则决策的系统分析方法。运用该分析方法对舰空导弹武器各作战通道的性能进行综合分析,其中在对决策矩阵进行计算时,使用了三种不同的效用函数对方案层的各项指标进行了量化,最后得出了各作战通道的综合价值,此值可为指挥员决策提供参考。计算结果表明该方法用于作战通道评价是切实可行的。     

英语歧义的理解与修辞功能

基于英语学习者有时候为歧义所困 ,从语义学和语用学的角度讨论了英语歧义的分类、理解和修辞功能 ;通过实例进行研究和分析 ,指出了影响歧义理解的主要因素并提出了相关对策 ;介绍了歧义的积极作用 .     

并行工程关键使能技术及其发展趋势

介绍了并行工程(ConcurrentEngineering,简称CE)的定义、基本原则、组成、驱动力和要素等,概要介绍了CE的部分关键使能技术。基于CE的理论研究与应用实践,给出实施CE的基本模式并进一步设想了CE的发展趋势。     

从简单句的切分看俄语词序

俄语词序有很大的自由度,但要受词汇、语法、交际目的和修辞色彩的限制,不能任意安排。本文拟从简单句的结构切分和实义切分着手分析,来了解俄语词序的一般规律及其功能。     

关于分形插值函数的积分

用反例说明在 [1 ,2 ]中关于分形插值函数的积分公式是错误的 ,并建立了关于分形插值函数积分的正确公式。     

新时期高校学生社团活动的特点和作用

高校学生社团活动在校园内蓬勃兴起,根据学生社团活动在新时期的新特点和对学生工作及跨世纪教育工程的特殊影响和作用,相关部门应给予积极的扶持,实施有效的管理,进行正面的引导,为最终实现高校教育目标将起到正面的。积极的作用     

分段函数在分界点求导的一种简单的方法

介绍了用多项式根的性质与导数极限定理求分段函数在分界点的导数的简单方法。从而拓广了用导数定义求分界点导数的传统方法     

加强成人《高等数学》的习作解题指导

教学中指导学生正确使用数学符号、正确运用基本概念、正确运用函数图象以及探索解题思路等 ,可以提高成人《高等数学》的教学质量 ,也可以提高统考的及格率     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998