Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling and due‐date quotation in a make‐to‐order supply chain

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于直线特征的车载电子稳像方法

电子稳像技术的研究重点是稳像算法,介绍了电子稳像的基本概念和原理以及常用的稳像算法,并根据坦克装甲车辆的实际情况,给出了车载电子稳像实验系统的基本构架及理论方法.选用块匹配法和直线特征法作为车载电子稳像算法,选用轨迹平均法作为图像序列的平滑方法,最后介绍了稳像效果的几种评价准则,并对车载电子稳像技术研究提出了几点设想.     

基于目标威胁度的相控阵雷达自适应调度方法

对时间资源的合理安排是相控阵雷达发挥自身优势的关键。将目标威胁度引入调度算法中,与工作方式和任务截止期共同进行综合优先级规划。通过构建目标威胁度的量化模型,使雷达在调度跟踪任务时依目标威胁度大小分配时间。提出了修正价值率和执行威胁率的概念,完善了性能评估指标。通过仿真,全面评价了新算法性能,验证了引入目标威胁度的合理性。结果表明,新算法可以有效提升相控阵雷达对高威胁度目标的处理能力。     

利用Unity3D引擎实现某飞行器攻防对抗仿真

为了实现某飞行器攻防对抗的可视化仿真,利用可视化模型数据库构建技术,构建了全尺寸、高沉浸感、多视角的可视化仿真环境。利用Unity3D引擎的脚本技术,实现了导弹尾焰、大气云层、爆炸冲击波、视点跟随等特效与功能。该平台使用C＃和Unity3D引擎进行开发,实现了攻防双方参数设置、计算数据和图表输出、仿真画面输出等功能,并能在多次仿真后,对不同的参数进行统计分析。该平台具有较好的扩展性,能够逼真再现飞行器的攻防对抗过程。结果表明,对于需要不断修正数学模型以逼近真实的攻防对抗过程,每次修正都能立即通过可视化平台查看、验证模型修改对攻防对抗过程带来的影响,对飞行器的设计、作战使用具有一定的参考价值。     

机务保障要求到保障方案转换

首先以装备可靠性为依据,以任务要求中任务时间、出动飞机数量、任务可靠度等参数为约束,建立了保障资源的配置模型;在确定保障资源配置基础上再以保障任务时间为优化目标,建立保障任务调度模型和调度算法,按照保障专业调度优化,为保障方案制定奠定了重要基础,对实行精确化保障有重要现实意义,对基层级的保障工作有很强的指导作用。     

飞机运动态势对航空深弹入水点散布影响分析

航空自导深弹具有结构简单、可靠性高、不受水文条件限制等特点,而且还具有自导捕获和跟踪目标能力,对于提高航空兵部队反潜能力具有重要作用。反潜机投放高度、投放速度等运动态势关系到使用航空自导深弹对目标实施准确打击。针对航空自导鱼雷攻潜实际过程,建立其入水点的散布误差模型和空中弹道模型,并仿真分析反潜机投弹高度、投弹速度对航空自导深弹入水点的影响。     

军用飞机大修效率评估方法

针对航空修理工厂大修效率难以评估的问题,首次提出了军用飞机大修效率评估方法。根据飞机大修工作特点,系统分析了飞机大修效率影响因素,建立了飞机大修效率评估指标体系;运用信息熵理论和灰色系统理论,构建出基于熵权和灰色聚类的评估指标赋权模型;结合实例验证了方法的正确性。     

基于通用扩张状态观测器的鲁棒飞行控制方法

针对参数不确定、外界干扰与测量噪声情况下飞行控制问题,提出一种基于通用扩张状态观测器的鲁棒飞行控制方法。基于状态相关的Riccati方程控制方法对飞行器俯仰通道非线性模型进行扩展线性化;引入基于通用扩张状态观测器的控制方法,设计干扰补偿增益,实现对外界干扰的估计与补偿;通过在线解算状态相关矩阵及代数黎卡提方程,得出状态反馈增益与干扰补偿增益,实现对飞行器期望攻角的跟踪控制。与已有方法对比表明,所提方法不仅对系统模型不确定性与外界干扰具有较强的鲁棒性,而且在较大测量噪声情况下,其依然能够保证良好的跟踪控制效果,具有较强的工程应用价值。     

基于变结构的应急航材调度策略

针对应急航材需求的随机性提出了变结构应急航材配送网络的概念,立足于物流运输车辆的优化调度,将现代优化算法引入应急航材的调度中,通过仿真算例的验证可以得出调运路径长度及应急航材需求量与调运时间成正比。