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

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

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

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

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

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

电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

基于遗传算法的多功能电子系统任务调度

雷达、通信、电子战等多功能一体化是未来作战平台电子系统的发展方向之一,任务优化调度技术是多功能电子系统的关键技术。针对多功能电子系统射频任务调度问题,在建立任务调度数学模型的基础上,采用了改进的遗传算法对模型进行了求解,提出了任务列表和随机键结合的编码方式,设计了以执行时间最短和任务丢失率最小为目标的多目标适应度函数,采用轮盘赌选择、改进型双点交叉和对称交换变异方式设计遗传操作。通过仿真实验,验证了所设计任务调度方法的有效性和优越性。     

双舰编队协同制导防空作战的动态拦截排序问题

针对双舰编队协同制导作战条件下如何对空袭目标进行排序这一问题,依据作战时间给出了排序算法。首先对平台的作战时间进行分析和求解,将射击周期分成了2段,把静态拦截排序问题转化为了2台处理机的同顺序作业排序问题,然后根据输入信息的改变而不断调整空袭目标的顺序以解决动态拦截排序问题,最后在想定条件下仿真计算,结果表明该算法具有较好的适用性。     

SpaceFibre星载数据网络低延时确定性调度算法

针对超高速SpaceFibre星载网络中多源数据传输的确定性和实时性应用需求,提出一种分类细粒度低延时确定性调度算法。该算法基于差异化调度策略的思想,将数据流划分为三类。为实现网络资源的细粒度分配,引入扩展时隙。该算法采用无冲突均匀调度方法,降低了数据包的平均排队延时。为适应有效载荷组网的航天应用场景,该算法兼顾网络拓扑结构生成调度方案。为验证算法有效性,在OPNET仿真平台下利用自定义建模技术搭建网络仿真模型。仿真结果表明:相比优先权调度和无冲突连续调度机制,该算法实现了时间敏感数据流的确定性传输;随着时隙数目的增加,网络的延时性能和抗抖动性能显著提升,吞吐量性能得到保证;该算法具有一定的航天工程实用价值。     

动态规划在消防增援调度中的应用

由于各消防中队一般规模较小，对于较大规模的火灾需要多个消防队共同救护，此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究，并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况，以实现最大程度地减小经济损失。     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.