舰载机多机一体化机务保障调度研究

针对舰载机多机一体化机务保障调度问题,以出树、入树的形式描述实际保障过程中并行工序的约束关系,以最大保障完工时间和资源负载均衡性为目标,构建了舰载机多机一体化机务保障非线性多目标混合流水车间调度模型,并设计了一种结合基于Insert的动态邻域爬山搜索策略和并行工序的同步化修正的Memetic算法求解该模型。最后通过实例仿真验证了模型和所提算法的可行性和有效性。     

STK飞行任务仿真及其在空地链路分析中的应用

飞行仿真是飞行航路设计,飞行任务规划以及飞行训练等项目中非常重要的一项任务。介绍了在STK(Satellite Tool Kit)的三维显示环境下,利用STK提供的专业化模块STK/AMM(Aircraft Mission Modeler)进行航空器飞行任务仿真的方法,详细阐述了利用该模块进行飞行任务规划和飞行路径设计的过程。同时结合STK的数据分析功能完成航空器在飞行过程中与地面台站的通信链路的可用性分析。给出的仿真方法较以往的仿真方法简单,设计过程更加灵活,可以快速地实现飞行任务仿真设计和空地通信链路的可用性分析。     

有限维修能力下多级保障系统装备时变可用度评估及保障方案优化

备件库存和站点维修能力是影响备件维修周转的重要因素,制约着装备的使用效果。针对备件需求随任务阶段动态变化时装备保障方案的评估和优化问题,考虑站点维修能力对备件维修过程的影响,结合METRIC建模方法和动态排队理论,建立了有限维修能力下多级保障系统装备时变可用度评估模型。在评估模型基础之上,以保障费用为优化目标、装备可用度为约束条件,建立任务期内多级保障系统保障方案优化模型。以任务期内的最低可用度所对应的备件短缺数为观测值,分析各项资源的边际效益值,采用边际优化算法对各项资源进行优化计算。算例分析表明,评估模型能够计算多级保障系统任务期内各阶段装备可用度;保障方案优化模型和方法能够得到各项保障资源的优化配置方案。提出的模型和优化方法能够为装备保障人员制订合理的保障方案提供决策支持。     

反导作战多传感器任务规划技术

多传感器任务规划技术是反导作战中的重要研究内容之一,即解决如何发挥多维传感器资源的互补优势,构建"传感器-目标-任务"序列,以实现整体执行效果最优。基于JDL信息融合模型深入剖析了反导作战多传感器任务规划体系结构及其信息交互。在此基础上,结合反导作战特点,从应用和理论研究两个方面分别对多传感器任务规划技术进行了叙述。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

舰船总体任务成功性的建模与应用

针对典型舰船的系统组成,进行了全舰任务成功性指标的示例计算,给出了总体指标的层次化表达方式。以舰船任务过程和典型任务剖面为依据,分析了任务可靠性和任务成功性之间的区别与联系,建立了舰船总体任务成功性指标的多阶段整体模型,并对航渡、待机、交战、撤离、返航阶段分别进行了仿真和解析建模。在建模与计算的基础上,通过敏感性分析计算了任务阶段持续时间的单位降低率等指标,为舰船任务成功性问题及其相关研究,提供了一个系统性的分析框架和方法。     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

资源不确定军事任务计划预测调度模型与算法

针对军事任务计划执行环境中普遍存在的资源不确定性,提出了基于资源缓冲区的军事任务计划预测调度算法。算法首先基于平台有效资源功能向量进行任务—平台分配,分配过程中通过调节平台有效资源功能向量,获得不同的平台资源缓冲区分配方案;然后基于NSGA-Ⅱ算法框架对军事任务计划进行多目标求解,进而获得问题的Pareto最优解集。文章通过仿真算例对算法的可行性和有效性进行验证,实验结果表明,该算法能够有效求解资源不确定军事任务计划问题。