Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

二次检测立方攻击改进与实现

对二次检测立方攻击预处理阶段的提取二次表达式的算法进行了改进以优化攻击效率。将秘密变量的变化引入攻击中,使得攻击模型更加灵活;同时,利用时空折中的思想,通过存储常数项和一次项的计算结果,有效降低二次项的计算量。将改进的方法应用于简化版的PRESENT算法和Trivium算法上,攻击效率有显著提高。     

指挥信息系统信息网络安全控制研究

针对指挥信息系统日益凸显的信息网络安全问题,分析了指挥信息系统结构模型及面临的安全威胁,在此基础上运用网络控制论的原理和方法,建立了指挥信息系统安全控制的基本框架和技术体系,明确了信息网络安全控制的核心内容和技术措施,并举例分析了信息网络安全控制系统的体系结构及组成功能,为有效保障指挥信息系统信息网络安全提供了新的途径和方法。     

航天器调度中的资源约束推理方法

资源水平边界的估计是构建资源利用可行计划中的一个基础问题。通过分析航天器资源约束的共享与分离并存、累积与瞬时消耗并存、过度订阅与区间调度并存等特点,提出了资源时间网络、时间约束网络和约束网络相结合的资源约束描述方法;构建了增量式基于包络的资源约束算法和最早开始时间链展开资源约束算法,以快速获取资源一致的柔性解。实例证明,该方法较好地解决了航天器调度的资源约束推理问题。     

指控系统中多操作系统启动工具的研究

指控系统中GRUB2作为启动引导器,管理多种操作系统平台。GRUB2采用模块化设计,可以提供给使用者更大的灵活性和性能改进。Linux系统的模块化设计与运行机制已被广泛讨论,有关GRUB2的模块化设计与运行机制的资料却很少。为了了解它的模块化编程与运行机制,通过对一个模块程序的分析,介绍了GRUB2中模块程序的基本结构及模块化设计的灵活性;并讨论了GRUB2的模块运行机制,明确了模块运行所需的底层工作。在此基础上,可以对GRUB2进行二次开发,扩展其应用场合。     

反舰导弹靶场试验精度评定方法

为了对小子样条件下反舰导弹靶场试验精度作出合理的评定,研究了自助法和随机加权法的原理。针对自助法和随机加权法存在的不足,研究了一种改进的方法,仿真结果表明新方法获得了更加稳健、精确的评定。最后,给出一些有益的工程应用建议。     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

威胁环境生存突防优化策略分析

讨论了影响飞机作战生存性的主要因素,建立了生存概率模型。根据生存概率模型确立了威胁环境生存突防优化策略。最后,为了简化计算推导了实用危险性模型     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

空战截击引导航线自动生成算法研究

以等角航线作为截击引导航线计算的基础,研究了满足战术要求的截击引导航线自动生成方法,提出了基于前置点滑动搜索的截击引导航线优化生成算法（LPMSOA,lead-point moving search optimal algorithm)。LPMSOA算法采用二分搜索思想,以到达时间差为优化准则,通过对预定敌机前置点的滑动搜索来寻找最优前置点,通过飞行航迹长度最小化获得最短截击时间,在此基础上对最优截击引导航线进行解算。仿真实验表明,LPMSOA能有效解决空战截击引导航线自动生成问题,算法实时性强,计算精度高。