Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

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     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Note: On the two‐machine no‐idle flowshop problem

In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000     

基于PC机对多总线导航计算机软件开发方法的研究

对基于多总线结构的计算机传统软件开发方式的局限性进行了分析 ,对一种基于IBM PC机为开发平台 ,采用 C语言开发的软件开发方法进行了研究和探讨 .文章对这一方法在使用中所存在的主要问题和解决的主要技术手段作了介绍 .在实际开发过程中 ,该方法已被证明简便、可行、有效 ,这对于类似基于多总线结构的导航计算机的许多计算机的软件开发均有一定的借鉴作用     

分布孔径红外系统的研究现状及其展望

介绍了分布孔径红外系统 ( DAIRS)的基本概念与研制现状 ,讨论了DAIRS在先进战斗机及其它作战平台上的应用 ,并简略介绍了其中涉及的关键技术 ,对 DAIRS系统将来可能的发展趋势作了预测。     

柴油机超小型水滴形预燃室的研究

针对12V180柴油机原球形预燃室喷嘴因热负荷过大而产生热裂和断裂脱落的问题,进行了理论分析和实验研究,提出了一种新型的预燃室-超小型水滴形预燃室．实验证明使用该预燃室,可以大大降低喷嘴的热负荷,提高喷嘴使用的可靠性．     

基于知识的雷达装备故障诊断方法

根据雷达的特点 ,将装备的深层原理知识引入到诊断中来 ,提出了一种面向对象的基于信号传输通道搜索的层次诊断模型和基于框架的层次分布式知识组织形式。具体分析了建立模型和组织知识的方法 ,给出了诊断推理策略和控制策略 ,并通过对某雷达装备的故障诊断 ,验证了其正确性。     

极坐标下雷达多目标跟踪及其实现

导出极坐标下雷达多目标跟踪的非线性滤波方程和预测方程 ,获得了稳定和渐近无偏估计 ;采用最优配对法进行点迹与航迹相关 ,避免相关模糊 ;利用记分法进行航迹质量管理 ,并在计算机上实现了多目标跟踪数据处理