全气动步兵武器表层自动喷涂机设计

分析目前步兵武器零件表层喷涂技术现状,提出全气动自动喷涂机设计方案,根据步兵武器零件结构特点,规划自动喷涂轨迹,设计全气动自动化喷涂专用设备．该设备具有本质安全性,适于部队条件下使用．     

基于CPLD与单片机的多路高精度数据采集系统设计

结合CPLD与单片机设计了一种多路高精度数据采集系统,最高可达24位转换精度。所采集数据具备良好的实时性,可采集通道数目多,同时系统具备较强的抗外界干扰能力,结构简单,可靠性好。该系统具有较强的可移植性,能够广泛应用于多路、高精度、低频数据采集的场合。     

Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

On equivalence between the proportionate flow shop and single‐machine scheduling problems

We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015     

Scheduling research and the first decade of NRLQ: A historical perspective

It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015     

机枪机器人的扫射方式和扫射角速度的研究

机枪机器人将在无人化战争中起到一定作用。使用者可以遥控射击,利用监视屏瞄准目标。由于图像传输延迟,监视屏上显示的图像反映目标在100 ms~300 ms之前的实际位置。射击移动目标是,如不考虑这一因素,将导致命中率降低。推导机枪机器人的扫射角速度计算式,对各种扫射方式进行分析和对比,以美制M240机枪为例进行仿真,进而找到了机枪机器人在平坦开阔地带的最优扫射方式。本方法可作为使用和设计机枪机器人的依据。     

火箭发动机故障检测的快速增量单分类支持向量机算法

为解决液体火箭发动机故障诊断正负样本不平均问题,以及实现发动机稳态工作段自适应故障检测,建立了基于快速增量单分类支持向量机的异常检测模型。采取特征工程方法,对传感器获得的多变量时间序列进行特征提取。通过增量学习方法,对单分类支持向量机模型进行改进,并应用于液体火箭发动机异常检测,使单分类支持向量机检测模型具备对不同台次、不同工况的自适应性,提高了模型的计算速度。对多台次热试车数据的分析结果表明,该模型十分有效,训练速度快,具备实用价值。     

基于灰色预测的时敏军事任务调度模型

为有效利用栅格化军事信息系统硬件冗余资源,提高系统运行时效,保证时敏军事任务执行效果,基于灰色理论的GM(1,1),提出了一种时敏军事任务调度模型。构建了基于主动式主/副本机制的调度流程,并针对普通(阈值)调度模型和模糊控制调度模型中调度触发的滞后和调度价值不确定的问题,设计了预测型调度时间窗口,有效优化了调度触发机制。最后通过仿真实验,考察了3种调度模型的有效性,结果表明模型虽然耗费了较大的调度开销,但在降低总体任务用时上作用明显。