Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

基于蚁群算法的航空弹药需求测算

智能化是现代航空弹药需求与指挥控制系统的发展趋势,如何进行合理快速地调拨航空弹药是系统设计过程中的关键任务之一。为此,提出了依据目标对航空弹药进行选择的策略,利用蚁群算法对战斗目标进行聚类分析,对各类目标进行模糊综合评判,从而确定装备出动方案,依据弹药与装备的关系,对满足既定保障度的弹药需求量建立模型,并计算出满足既定保障度的弹药供应量,为战前对战场态势预估,实现弹药战时及时准确调拨,为作战弹药准备提供依据。     

平流层飞艇高能激光武器防御弹道导弹

防御弹道导弹逐渐受到世界各国的重视,扩大拦截窗口是重要的发展趋势之一。平流层飞艇有可能通过艇载激光武器或者中继反射地基激光两种方式拦截自由段弹道导弹,为评估这两种方式的拦截效果和可行性,本文分析了平流层飞艇搭载高能激光武器的可能性以及中继反射作战方式的特点,建立了激光烧蚀模型,采用数值计算方法对激光的烧蚀效果进行了研究,结果表明平流层飞艇部署位置应距离导弹发射点800～1000km,平流层中继激光飞艇能够在短时间内引爆弹头,艇载激光武器采用烧蚀弹头防热层的方法同样可以达到拦截弹道导弹的目的。     

混合指数分布模型的Bayes分析

针对截尾试验数据的情况,给出了二元混合指数分布模型的平均寿命和可靠性函数的严格的Ｂａｙｅｓ点估计,并运用最大熵准则给出了可靠性函数的近似的Ｂａｙｅｓ置信下限估计。     

飞行器MDO中灵敏度计算的自动微分方法

自动微分方法(ADM)是灵敏度计算的一种新方法,是处理飞行器多学科设计优化中灵敏度分析问题的有力工具。将ADM与估算灵敏度最常用的有限差分方法(FDM)以及与ADM同时期发展起来的另外一种灵敏度计算方法—复变量方法(CVM),从原理上进行了比较,研究了ADM前向模式在Visual C 6.0环境中的实现方法,结合多学科环境中的飞行器设计优化计算实例分析了该模式的优缺点。ADM在科学计算、工程计算等方面有很大的发展空间。     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

旋转飞行器非线性运动稳定性判据

在弹体坐标系和准弹体坐标系中建立了旋转飞行器角运动数学模型。应用李亚普诺夫第一近似理论和劳斯-霍尔维茨方法导出了旋转飞行器的非线性运动稳定性判据,这个判据可应用于有控旋转导弹的运动稳定性分析,也可应用到炮弹和火箭弹上。     

老子军事人道主义政治观刍议

老子以“道法自然”、“天道尚慈”为法理依据,提出了军事人道主义政治观,对战争的本质、性质和起源以及军事战略战术原则作了独具匠心的回答。“处柔、主静、守中”是《老子》军事人道主义政治观的三大基本运行法则。道家对“人”的终极关怀,“以正治国、无为而治”的政治艺术,“处柔克刚”、“不争而善胜”、“恬然为上”的战略思想以及“欲擒故纵”、“以奇用兵”等战术理念是中国政治文化史上的宝贵精神财富,至今对现代军事政治文化研究仍不失借鉴价值。     

推进国防建设与经济建设协调发展的内在要求

推进国防建设与经济建设协调发展,必须坚持用科学发展观来统筹国防建设与经济建设关系,努力形成“军民结合、寓军于民”的良性互动机制,并按照“有所为、有所不为”要求加快国防现代化建设。