集群通信在消防通信调度指挥系统中的应用

无线通信网是消防部队在执行灭火抢险救援任务时,确保完成信息传达、灭火抢险救援指挥、协同作战等任务的关键。为了更好的开发集群通信的功能,介绍了集群通信的概念、组网方式,并探讨了通信区域扩展的方法。     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

机动目标状态估计的最小均方误差界

基于多项式模型的各种自适应滤波算法被广泛应用于机动目标跟踪领域,但尚没有统一的评估标准来衡量这些跟踪算法的优劣。由于存在确定的时变未知输入,机动目标的状态估计实际为有偏估计。基于状态估计均方误差最小的准则,推导了多项式模型滤波的最小均方误差界计算方法,获得了使状态估计均方误差最小的过程噪声方差变化规律。该方法给出了各种基于多项式模型的机动目标跟踪算法的估计均方误差下限,也为机动目标跟踪中最优过程噪声方差的设定提供了依据。仿真结果验证了算法的有效性。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

高精度单频信号初相测量方法

提出了一种基于误差知识的二重插值DFT方法用于高精度时钟初相测量。理论分析与数值仿真结果表明,该方法性能接近Cramer-Rao界。     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于统计性QoS保证的数据包延时界调度算法

讨论了调度算法的性能指标,对目前基于业务流的调度算法的技术特点与性能优劣进行了分析和比较.重点研究了基于时延和丢包率的算法,并提出了一种基于数据包延时界(PDB)排列的调度策略,与WFQ及传统EDF算法进行了比较,证明业务端到端超时概率随网络带宽利用率的变化性能优于传统EDF算法.     

随机弱实时系统作业调度概率保证分析

随机弱实时系统与强实时系统的显著区别是 ,它不要求实时任务的每一项作业都满足时限要求 ,只要保证作业的时限延误率低于某一阈值 ,其总体执行性能就是可以接受的。提出了概率时间需求分析法 (PTDA) ,用于估计可剥夺静态优先级调度策略下周期性任务的作业满足时限约束的概率的下界 ,并通过一个具体的实例考察了下界的紧性。对实例系统的仿真结果表明 ,PTDA分析的误差小于 1 0 % ,计算速度快 ,可以为弱实时应用的设计提供重要的参考依据