Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

一种基于克隆选择原理的空战目标分配算法

针对空战目标分配问题,在以优势函数为空战模型的基础上,提出了一种基于克隆选择原理的目标分配算法,并引入混沌算子,增强了算法中个体的多样性和稳定性,减少算法的盲目性,提高了算法的收敛速度。根据克隆选择原理,分析了算法的编码方式、克隆选择算子对算法的影响,给出了算法的流程。最后进行了仿真,结果表明了算法的有效性。     

战机最速角度机动攻击导引指令生成算法

针对现代空战的特点,根据战机飞行动力学,对时间最优情况下的最速角度机动攻击导引指令生成进行了研究。将最速角度指向机动导引控制问题视为受终端状态、过程以及控制约束的多约束优化问题,通过引入惩罚函数将多约束优化问题转化为无约束优化问题,然后利用共轭梯度法寻优得到导引指令,给出了最速角度指向机动导引指令生成的具体算法,最终通过仿真证明了所提算法的有效性。     

文学语言形象性探微

文学的生命在于形象。文学形象,是语言的形象,语言的艺术。语言丰富是语言形象的基础,语言生动是语言形象的生命。学好口语亦有助于语言形象美。     

浅谈《孙子兵法》与竞争智慧

孙子有备无患的军事思想,早已成为现代竞争领域的指导原则之一。每个人都有非常强烈的成功欲望,这样的人生,是一个永不停息的决策过程。从事什么样的工作,怎样做才能使自己在竞争中立于不败之地。《孙子兵法》告诉我们：人生竞争有策略。     

基于ADS软件的卫星通信系统仿真平台的搭建

卫星通信系统仿真平台可以完整模拟卫星通信链路,并能有效分析卫星通信系统的抗干扰能力,从而达到减少外场试验次数,加快研发周期,节约硬件资源的目的。选用安捷伦公司开发的ADS(advanced design system)软件建立该仿真平台。通过对ADS现有模块的二次开发,搭建了直序扩频(DSSS)信号发生调制模块、发射机模块、接收机模块等,开发了新的ADS干扰信号发生模块和同步互相关模块,进行了正常通信下和单音干扰下卫星通信链路的模拟仿真。     

我国企业发展商务应树立“商务为本”的理念

本文主要阐述了发展电子商务过程中应建立“商务为本”的理念及“商务为本”的理念的含义。     

我国光电火控系统亟待解决的问题

介绍了光电跟踪器的优点 ,分析了我国目前光电跟踪器的现状 ,从装备发展的角度指出了光电跟踪器及光电火控系统亟待解决的科研课题     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

水力旋流器流场研究进展

水力旋流器内部的流场非常复杂,但其研究对提高水力旋流器的分离性能和实现结构优化具有重要意义。从实验研究和数值模拟研究两方面总结了国内外学者在水力旋流器流场研究方面的主要成果,对研究过程中所采用的研究方法进行了描述,分析比较了研究结果,并对未来研究的方向进行了展望。