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     

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

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

球形破片侵彻明胶运动模型及破片参数敏感性分析

为揭示球形破片对人体组织致伤机理,以明胶作为人体组织的替代物,基于动态空腔膨胀理论,考虑球形破片未完全侵入阶段的速度衰减,建立了球形破片侵彻明胶的分段运动理论模型,研究了球形破片侵彻明胶的运动规律。通过钢球和钨球侵彻明胶的实验验证了模型的正确性,求解了模型中的最优阻力系数。分析了理论计算过程中的误差来源,并推导得到了无量纲侵彻深度的表达式。利用Sobol′法进行了球形破片参数(直径、密度和速度)对侵彻深度影响的敏感性分析。结果表明：运动模型能够较好地模拟球形破片的运动规律;低密度的球形破片在未完全侵入阶段的速度衰减不能忽略;球形破片参数对侵彻深度影响的敏感性由高到低依次是速度、密度和直径。     

含水声对抗模型的鱼雷武器作战仿真系统

以现代海战为背景,采用基于高层体系结构(High Level Architecture,HLA)的建模、开发软件平台Lab Works、pRTI构建了开放式、可扩展的鱼雷武器作战仿真系统.该系统在弹道仿真的基础上引入了水声对抗模型,将鱼雷自导解算模型和目标环境空间生成模型相耦合,组成能在一台微机上进行仿真解算的声信号处理联邦成员,避免了大量数据在网络上的传输.仿真运行结果显示,采用这种方法.既保证了仿真的实时性,又提高了模型解算的精确性.     

增大政治工作科学含量之我见

增大政治工作科学含量,是提高政治工作效率、增强政治工作有效性的必由之路。本文论述了增大政治工作科学含量的必要性,并提出增大政治工作科学含量的六个切入点,即：对政治工作实施科学的宏观指导,围绕信息化建设开展政治工作,科学制定与完善思想政治教育内容与方法,科学理解和运用政治工作方法,提高政治工作主体素质,强化在继承中求创新的观念。     

用于高功率微波测量的电磁探针研究

叙述了一种用于高功率微波峰值功率测量的电磁探针的基本原理及结构设计,给出了电磁探针设计的理论数据以及标定方法和标定结果。该探针具有承受微波功率高,密封好,结构简单,使用方便等优点。为高功率微波峰值功率测量提供了一种有效实用的技术手段     

边疆地区政治社会化有效性思考

边疆地区有其独特的历史文化等传统,有着复杂的自然条件和环境,特殊的地理位置,边疆地区的政治社会化程度直接影响到主导型政治文化的实现,影响到该地区的稳定和发展,关系到边防的巩固和国家的统一。该地区的政治社会化要在重点对象确定的前提下,既要注重发挥其主要途径的作用、又要注重其内容的针对性和时效性、更要注意较大地区差距的负面影响并努力将其缩小,才能使边疆地区政治社会化有较好的效果。     

引信静态试验模拟动态试验研究

研究了用静态试验评价无线电引信质量性能的方法。分析了静态试验项目、样本量的确定,建立了各组件失效与引信失效的对应关系,提出了通过组件的失效信息计算引信失效率的方法。     

电力有源滤波器的研究现状及发展

分别对目前电力有源滤波器滤波系统的结构、特性、优点、缺点、适用场合作了阐述．介绍了电力有源滤波器的信号检测和控制的几种最新方法．