On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

C~3I 系统中基于多目标决策理论的对空攻击任务分配决策问题研究

根据多目标决策理论,从系统的角度出发,提出了防御权系数问题,并在此基础上研究对空攻击任务的分配策略,给出了效度最大攻击任务分配策略和重点防护目标优先攻击任务分配策略,并引入攻击强度阀值概念,对这两种分配策略进行了改进,最后给出了具体算法。     

一种用于 C~3I 系统的异类传感器数据融合算法

在文献〔８〕和〔９〕基础上研究了在不等样本情况下的异类传感器——雷达与ＥＳＭ——的航迹相关问题。首先,基于模糊综合函数找出两个最可能的雷达与ＥＳＭ航迹相关对,然后,利用统计理论并采用多门限决策方法进行雷达与ＥＳＭ航迹相关判决。仿真结果表明,与文献〔８〕的方法相比,在雷达航迹比较多的情况下,本文所提出的在不等样本情况下的雷达与ＥＳＭ相关算法具有与其很相近的性能,但计算量明显减少;而与文献〔９〕的方法相比,这里采用多门限决策方法又可同时减小两类错误概率。     

未知非线性系统的神经网络建模与控制仿真研究

针对一类未知非线性系统的建模与控制问题,采用基于神经网络的多步预测控制算法进行了仿真研究,仿真对象选取控制工程界常用的单摆试验装置.该算法的实现步骤为:获取系统开环试验数据;辨识神经网络正向动态模型;设计非线性优化控制律.仿真研究结果表明,所提出的建模与控制方法是有效的.     

引战配合三维计算机图形仿真的新技术

介绍了一种研制高质量引战配合三维计算机图形仿真软件的新技术。在目前广泛流行的３２ 位Ｗｉｎｄｏｗ ｓ 操作平台 （Ｗｉｎｄｏｗ ｓ ９５ 和Ｗｉｎｄｏｗ ｓＮＴ） 上利用Ｏｐ ｅｎＧＬ开发了多用途导弹反武装直升机引战配合三维图形仿真软件３Ｄ－ ＭＵＭ。运行结果表明： 该软件具有导弹和目标几何造型逼真、形象生动、使用方便灵活、运行速度高等优点     

On the availability of R out of N repairable systems

An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

信息网络作战技术

信息战是现代战争中重要作战样式,网络战是信息战的重要组成部分,分布式、网络化的计算机系统是信息作战中实施攻击与防护首要作战目标。根据网络作战的需求,从技术角度出发,首先对网络战的要素组成进行了分析,在此基础上将网络战划分为两个阶段,并对此进行了深入研究,最后提出了实施网络战的方法与步骤。     

L+1容错恢复策略在复杂军事网络中的应用仿真

以标准3×3网格为基础网络,介绍了L+1容错恢复策略的概念和恢复原理,以海上舰艇编队作战系统网络为研究对象,使用Matlab-Simulink仿真工具,通过对阻塞概率、平均路径长度、路径重新分配概率和有效利用率4个指标的仿真,对比了该网络在无策略、备份多路和L+1容错恢复3种策略下网络的恢复程度,验证了L+1容错恢复策略的有效性和可行性。