目标通视性检测建模与仿真

在战斗机对地攻击选择武器投放位置以及巡航导弹选择地标点时,必须验证其选择位置的合理性,因此通视性检测是战斗机对地攻击规划的关键技术之一。提出了一种目标通视性检测的建模方法,分析了地形遮蔽盲区构成因素,给出了数字地图处理方法,建立了地形遮蔽盲区计算模型及发现目标概率模型,实现了目标的通视性检测,并进行了仿真验证。该模型为战斗机对地攻击选择武器投放位置和验证导弹地标点选择合理性提高了方法。     

美国空军研究实验室组织管理与科研规划分析

美国空军研究实验室是一个在空中、太空和网络空间领域处于全球领先地位的科研机构,承担着美国空军国防高技术项目的规划、管理和实施工作,是美国空军保持技术优势的重要研究力量。本文剖析了美国空军实验室的使命任务、组织管理和科研规划,总结了实验室在人才培养和科研任务制定方面的经验和方法。     

军用航空发动机大修能力评估方法

针对航空发动机修理工厂大修能力难以评估的问题,提出了航空发动机大修能力评估方法。分析了航空发动机大修生产过程;根据航空发动机大修生产工作特点,建立了基于生产职能分解的航空发动机大修能力评估指标体系,构建出基于熵权和灰色聚类的评估指标赋权模型;结合实例验证了方法的正确性和实用性。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

舰船建造费随批量变化的成长模型分析

应用微分方程、回归分析及生长曲线３段估算法,建立批量生产条件下舰船单价变化模型,这一模型可与其他模型综合应用以取得更理想的结果．     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Production to order and off‐line inspection when the production process is partially observable

This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

分层任务网络在UCAV规划中的应用

无人战斗机任务规划对提高它的生存能力、突防能力、作战效能具有重要意义.分层任务网络规划是一个有效的规划方法,HTNP的最大好处在于,搜索受控于细心设计的方法.在某种意义上讲,一个HTN规划器只描述了如何使用操作,给实际使用带来了困难.在HTNP中引入目标协调机制、禁忌表等,将原有"离线"式方法变为"在线"式方法,提高了方法的适应性能.可以根据情况的变化,随时生成新的规划,降低了预先设计方法的数量,从而降低工程实施的难度.     

天基支援下区域反导组网作战链路规划

天基信息支援下区域反导组网作战各系统实现互连、互通、互操作的关键是战术信息分发系统,而该系统中存在着多种类型的数据链路,这些链路之间又存在着各种约束条件,因此科学合理的对这些链路进行规划是系统实现的重要工作之一.建立并提出了天基信息支援下区域反导组网作战战术信息分发系统数据链路的规划模型和一种新的解算方法,为该系统数据链路的规划提供了理论依据.