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     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

用毁伤概率指标优化二点源诱饵系统布阵

两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。     

基于冗余的复杂体系动态适应性结构设计研究

针对复杂体系动态适应性研究所存在的问题,提出了复杂体系冗余概念和基于冗余的复杂体系动态适应性结构设计思想,讨论了基于冗余的复杂体系动态博弈设计过程及体系结构;在此基础上,根据复杂体系使命目标的执行特点及体系本身的结构特性,详细地阐述了复杂体系中的任务冗余、系统冗余和结构冗余三种冗余类型,并从冗余切换方式、冗余具体内容和冗余表现性质三个方面论述了复杂体系中各种冗余所组成的冗余体系,指出冗余体系是复杂体系适应环境的一种策略,也是复杂体系不断演化的需要和结果,并且能够为复杂体系动态适应性结构的构建及其效能评估和复杂体系的优化及改进等研究提供一定的理论指导。     

弹炮结合防空武器系统毁伤概率分析与仿真

针对弹炮结合防空武器系统毁伤概率是决定系统效能的关键问题,分析了决定系统精度和毁伤概率的主要因素及其相互关系.以单枚导弹对目标的毁伤概率和高炮一次点射对目标的毁伤概率为目的,建立了弹炮结合系统毁伤概率分析模型.通过计算机仿真得出了一定航路条件下对典型目标射击,高炮一个2S长的36发点射的平均毁伤概率为40%,单枚导弹的平均毁伤概率为63%.在2枚导弹和2个点射的情况下,系统总的毁伤概率可达97.8%.     

坦克火炮射击时舱室有害气体动态分析及评价

分析及评价坦克火炮射击时舱室内有害气体的变化。以某型坦克为试验样车,测定坦克火炮射击时舱室有害气体如:无机污染物、总悬浮颗粒物(TSP)及挥发性有机物(VOCs)浓度并观察其动态变化。测定出舱室主要有害气体以一氧化碳(CO)、二氧化硫(SO2)、氨(NH3)、TSP和总烃为主,有害气体浓度随发射炮弹数目的增加而升高,其中又以CO浓度最大。为加速坦克作业环境限值的国家军用标准的补充和修订提供依据。     

防空地监哨情报融合研究*

在得到防空地监哨直接观测信息的基础上,对目标可能航向进行二次外推,并利用效用函数综合评估法对目标相关性进行检验,完成对目标信息的融合,解决了地监哨情报数据的关联和航迹外推问题。仿真及试验结果表明该方法用于防空地监哨情报融合是可行的,其结果分析的应用能指导地监哨训练和战时地监哨的配置。     

炮兵部队网络火力战问题研究

针对目前炮兵部队装备建设基础薄弱、炮种多、作战协调复杂的现状,依据计算机网络相关理论建立了炮兵部队网络火力战体系结构,同时运用梅卡夫定理对炮兵部队网络火力战体系的作战威力和协同能力进行了分析评估,并进行了作战运用分析。经过评估,炮兵部队网络火力战体系将大大提高炮兵部队的协同作战能力。     

改进的AHP法在目标价值排序中的应用

针对在应用AHP法时,传统的标度法可能导致判断矩阵一致性与思维一致性脱节,进而破坏层次分析法的优选排序功能的问题。首先分析了传统的1～9标度的不足,然后通过引入指数(0,2)标度,建立了满足一致性要求的判断矩阵,改进了层次分析法。最后将改进的AHP法应用于战场炮兵的主要攻击目标价值排序的评估,进一步提高了评估的准确性。