新型驱护舰编队舰空导弹防御体系射击效能研究

针对新型驱护舰编队舰空导弹防御体系射击效能评估这一难题,对其射击效能准则进行了确立,提出了基于排队论的射击效能评估模型,对体系射击效能进行仿真计算,总结出能对系统射击效能做出准确评估的方法,并利用实例对模型进行了验证。     

Optimal material control in an assembly system with component commonality

Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001     

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     

Applying a bootstrap approach for setting reorder points in military supply systems

This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000     

舰空导弹拦截反舰导弹能力的研究

根据舰空导弹的战术技术性能和特点,分析了影响舰空导弹拦截能力的主要因素,并以反舰导弹为拦截目标,建立了舰空导弹拦截反舰导弹的数学模型,并对模型进行了分析,提出了为提高舰空导弹拦截能力在战术和技术上要采取的主要措施.     

通用武器装备供应系统设计中的硬、软系统方法整合研究

分析了硬、软系统方法应用的异同点,研究了将硬、软系统方法整合起来处理通用装备供应系统设计的问题,最后提出了系统设计的框架。     

船舶结构力学的新近进展

本文基于国际船舶与离岸结构会议第11届大会的技术报告,论述船舶结构力学的新近进展。文中介绍了船舶结构力学的研究范围不断扩大,结构设计目标多元化,可靠性分析方法的建立和应用,数值计算方法的广泛采用,非线性分析的深入,水弹性力学受到重视,复合材料的应用,材料和工艺因素对船舶结构的影响等方面的进展。     

等、变深度舰船水压场的理论计算

在浅水、薄船、无限宽水域的条件下,舰船以亚临界速度(F_H<1)运动时,利用E.O.Tuck提出的渐近匹配展开法,可以得到定深度扰动速度势的摄动方程。对水深缓慢变化的海底,舰船的绕流不再是定常的,根据A.Plotkin所采用的多重尺度法,可以得到变深度浅水舰船扰动速度势的摄动方程。如果仅考虑扰动速度势的一阶摄动方程,则可得到考虑了线性兴波影响的舰船水压场的计算公式。     

车辆悬挂系统的主动优化控制器设计及仿真

基于特征结构配置参数化结果,提出了车辆悬挂系统的主动优化控制器设计方法。该方法直接基于车辆悬挂系统的参数矩阵,便于工程应用。车辆悬挂系统的仿真实例表明所提主动优化控制器设计方法简单且有效。     

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