On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

未来中远距协同空战多目标攻击决策研究

根据先进战斗机的技术特点和未来中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,采用一种将并行遗传算法与分布估计算法相结合的并行分布遗传算法并将其用于多目标攻击决策。最后利用具体算例进行仿真。结果表明空战态势分析模型能够较为准确地描述未来中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。     

航迹关联算法仿真中的几个假定

航迹关联是多传感器信息融合的前提和基础,来自不同传感器的航迹数据只有在确定相互关联之后,才能进行目标运动状态信息和属性信息的融合处理。航迹关联仿真分析时往往人为地设定一些假定条件,导致算法的仿真结果出现比较大的偏差。对航迹关联算法仿真分析中的一些常见假定进行分析,结合实际应用情景,探讨航迹关联率的定义,明确了关联正确率、关联错误率和漏关联率的计算方法。     

基于遗传BP神经网络的装甲装备器材需求预测

装甲装备器材保障具有规模大、时间紧、消耗大、不确定因素多、决策难度大等特点。准确的需求预测是实施主动的、精细化的器材保障的重要前提条件。利用BP神经网络较强自学习能力和自适应能力对器材需求规律进行学习,并借助遗传算法提高BP神经网络的收敛速度,设计了一种基于遗传算法改进的BP神经网络模型预测方法,对装甲装备器材进行需求预测。通过实例计算表明,该方法比单纯BP神经网络方法具有预测精度高、收敛速度快的优点。     

基于静止标量磁强计的运动舰船定位问题的研究

建立了静止标量磁强计对运动舰船定位的模型,并给出了用遗传算法求全局较优解、然后用单纯形法进行精确局部搜索的求解参数的方法.仿真实验表明这种方法有效、可行.     

HLA的雷达目标跟踪算法验证系统

构建了一个基于HLA的雷达目标跟踪分布式仿真系统。采用组件设计思想,实现目标跟踪组件和滤波组件,并将这两套组件嵌入到目标跟踪分布式仿真系统中。实践结果表明:基于组件思想构建的目标跟踪和滤波算法能够很好嵌入到分布式雷达目标跟踪系统中,从而为跟踪算法的合理选择、算法参数的优化设计,以及实际系统的研制提供有力支撑。     

基于RWC的机载SAR斜视成像仿真

通过建立机载合成孔径雷达的工作模型,介绍了SAR的基本成像原理,并针对机载SAR在斜视条件下,因距离走动量较大,对地面目标的成像受到严重影响的情况,详细分析了距离走动产生的原因。在傅里叶变换之前使用对距离走动进行校正的CS算法对经典的CS算法作出了改进,重点推导了改进后算法的实现过程,并通过Matlab仿真模拟地面目标物实现了CS算法在不同条件下的成像结果,证明使用改进后的算法在斜视角情况下成像质量有较大的改善。     

无人机航迹规划常用算法

无人机航迹规划是实现无人机自主飞行的关键技术保障,航迹规划算法则是航迹规划的核心。首先介绍无人机航迹规划的相关理论,其次分析归纳了当前常用的航迹规划算法,最后阐述了航迹规划所面临的挑战及其发展方向。     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.