Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Analysis of supply contracts with commitments and flexibility

In this article we address an important class of supply contracts called the Rolling Horizon Flexibility (RHF) contracts. Under such a contract, at the beginning of the horizon a buyer has to commit requirements for components for each period into the future. Usually, a supplier provides limited flexibility to the buyer to adjust the current order and future commitments in a rolling horizon manner. We present a general model for a buyer's procurement decision under RHF contracts. We propose two heuristics and derive a lower bound. Numerically, we demonstrate the effectiveness of the heuristics for both stationary and non‐stationary demands. We show that the heuristics are easy to compute, and hence, amenable to practical implementation. We also propose two measures for the order process that allow us to (a) evaluate the effectiveness of RHF contracts in restricting the variability in the orders, and (b) measure the accuracy of advance information vis‐a‐vis the actual orders. Numerically we demonstrate that the order process variability decreases significantly as flexibility decreases without a dramatic increase in expected costs. Our numerical studies provide several other managerial insights for the buyer; for example, we provide insights into how much flexibility is sufficient, the value of additional flexibility, the effect of flexibility on customer satisfaction (as measured by fill rate), etc. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于失供概率的弹药储备构成分析

弹药储备与失供问题是战时弹药供应决策的核心问题之一。以师规模的野战阵地防御战为例,运用弹药消耗模式仿真模型进行弹药储备量与失供概率关系定量分析,为合理确定弹药储备构成提供科学的辅助决策手段。     

关于内燃机原理若干问题的分析

本文分析了柴油机的最大扭矩、扭矩储备系数、喷油系统喷油量与柱塞几何供油量的差异和变化规律,认为这3个参数的现行定义不尽合理,并给出了新的定义。     

陆军师进攻战斗弹药保障辅助决策模型

本文依据师弹药保障的特点,通过对历次作战军械保障资料的统计研究,建立了动态自适应弹药消耗预计模型和弹药保障方案目标规划模型,并给出了计算机程序实现框图。     

备件供应系统及其保证度模型研究

本文针对备件供应决策问题,提出了备件保证度的概念,阐述了保证度与使用可用度的关系,认为影响保证度的主要因素是:备件修复时间、备件获取时间、库存水平、设备数量及复杂程度和备件需求率,分析了二级供应系统的普遍性和代表性,并应用概率论的原理,建立了备件保证度模型。     

潜艇开关电源的应用及发展方向

研究了潜艇开关电源的应用现状,分析讨论了３ 种最基本的高频开关型变流电路的工作原理,指出潜艇开关电源今后的发展方向：开关频率高频化,硬件结构模块化,控制系统数字化及产品性能绿色化,并在全艇采用分布式配电系统对各舱室负载独立供电．     

弹药保障效果评价的AHP-FUZZY方法

简要分析了我军弹药保障效果评价工作的不足之处,在此基础上,综合运用层次分析技术（AHP）和模糊评判技术（Fuzzy）,对战场上弹药保障效果评价进行了探讨。运用AHP法建立了弹药保障效果评价的层次结构模型,并详细论述了运用Fuzzy方法评价弹药保障效果的实现过程和注意问题。     

新型小规模装备备件品种确定的犹豫模糊粗糙集决策方法

针对新研装备备件品种确定过程中决策信息“犹豫性”和“模糊性”特点突出、难以运用传统备件品种确定方法进行决策的问题,提出一种基于犹豫模糊粗糙集的备件品种确定方法。利用风险偏好系数对不完备犹豫模糊信息进行数值延拓,为构建不同风险偏好下备件品种确定的犹豫模糊决策信息系统奠定了基础；考虑得分函数和数值延拓边界的综合因素影响给出了改进的包含度计算公式,并基于包含度定义进行了证明；给出了基于改进包含度计算的备件品种决策属性的约简条件和规则获取方法,实现了犹豫模糊决策信息的深度挖掘和有效利用。以某新研装备备件品种确定为例进行了方法验证,研究结果表明：通过该法能够有效处理犹豫模糊决策信息,获取精简实用的备件品种决策规则集,验证了方法的可行性。     

Fixed‐interval joint‐replenishment policies for distribution systems with multiple retailers and stochastic demand

We consider a distribution system consisting of a central warehouse and a group of retailers facing independent stochastic demand. The retailers replenish from the warehouse, and the warehouse from an outside supplier with ample supply. Time is continuous. Most previous studies on inventory control policies for this system have considered stock‐based batch‐ordering policies. We develop a time‐based joint‐replenishment policy in this study. Let the warehouse set up a basic replenishment interval. The retailers are replenished through the warehouse in intervals that are integer multiples of the basic replenishment interval. No inventory is carried at the warehouse. We provide an exact evaluation of the long‐term average system costs under the assumption that stock can be balanced among the retailers. The structural properties of the inventory system are characterized. We show that, although it is well known that stock‐based inventory control policies dominate time‐based inventory control policies at a single facility, this dominance does not hold for distribution systems with multiple retailers and stochastic demand. This is because the latter can provide a more efficient mechanism to streamline inventory flow and pool retailer demand, even though the former may be able to use more updated stock information to optimize system performance. The findings of the study provide insights about the key factors that drive the performance of a multiechelon inventory control system. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 637–651, 2013