Nonstationary stochastic gold-mining: A time-sequential tactical-allocation problem

This paper presents an extension of gold-mining problems formulated in earlier work by R. Bellman and J. Kadane. Bellman assumes there are two gold mines labeled A and B, respectively, each with a known initial amount of gold. There is one delicate gold-mining machine which can be used to excavate one mine per day. Associated with mine A is a known constant return rate and a known constant probability of breakdown. There is also a return rate and probability of breakdown for mine B. Bellman solves the problem of finding a sequential decision procedure to maximize the expected amount of gold obtained before breakdown of the machine. Kadane extends the problem by assuming that there are several mines and that there are sequences of constants such that the jth constant for each mine represents the return rate for the jth excavation of that mine. He also assumes that the probability of breakdown during the jth excavation of a mine depends on j. We extend these results by assuming that the return rates are random variables with known joint distribution and by allowing the probability of breakdown to be a function of previous observations on the return rates. We show that under certain regularity conditions on the joint distributions of the random variables, the optimal policy is: at each stage always select a mine which has maximal conditional expected return per unit risk. This gold-mining problem is also a formulation of the problem of time-sequential tactical allocation of bombers to targets. Several examples illustrating these results are presented.     

A three-echelon,multi-item model for recoverable items

The main objective of this paper is to develop a mathematical model for a particular type of three-echelon inventory system. The proposed model is being used by the Air Force to evaluate inventory investment requirements for alternative logistic structures. The system we will model consists of a group of locations, called bases, and a central depot. The items of concern in our analysis are called recoverable items, that is, items that can be repaired when they fail. Furthermore, each item has a modular or hierarchical design. Briefly, the model is used to determine the stock levels at each location for each item so as to achieve optimum inventory-system performance for a given level of investment. An algorithm for the computation of stock levels for each item and location is developed and illustrated. Some of the ways the model can be used are illustrated with Air Force data.     

Approximation techniques in the solution of queueing problems

In the study of complex queueing systems, analysis techniques aimed al providing exact solutions become ineffective. Approximation techniques provide an attractive alternative in such cases. This paper gives an overview of different types of approximation techniques available in the literature and points out their relative merits. Also, the need for proper validation procedures of approximation techniques is emphasized.     

基于模型参考的机电精密驱动系统滞后效应补偿

概述 机电伺服驱动系统作为现代自动化技术中的关键部分之一,其轻质量和小体积对于应用精密齿轮系而言具有独到的作用。为了保证驱动系统的高功率密度,其要求系统具有高传动比和紧凑的齿轮结构,实现这一目的的方法是使齿轮系的轮牙大量啮合以使作用力矩并行分配从而提高系统的功率比。例如:井齿轮(Well Gear)具有使高达30％的轮牙同时啮合的独特结构,由此给齿轮传动特性带来一些非线性影响,如:衰减柔顺性、     

精密机床导轨的测量分析

本文提出了一个用于质量诊断的精密机床导轨分析系统。受控目标的质量评估是依据于对一个物体在选定区间内的测量形状与位置偏差来确定的。质量评估采用相关综合指标的形式:基本误差函数,综合不平行度。在对完整的支撑部件或导向部件作评估的时候,这套系统能对各部件的位置做校正。本文所描述的计算机系统能控制任何测量系统。目前的版本是控制一个测量平动与转动位移量的激光干涉仪。     

An application of the MTP2 property on bounds on system reliability

This paper is concerned with the joint prior distribution of the dependent reliabilities of the components of a binary system. When this distribution is MTP₂ (Multivariate Totally Positive of Order 2), it is shown in general that this actually makes the machinery of Natvig and Eide [7] available to arrive at the posterior distribution of the system's reliability, based on data both at the component and system level. As an illustration in a common environmental stress case, the joint prior distribution of the reliabilities is shown to have the MTP₂ property. We also show, similarly to Gåsemyr and Natvig [3], for the case of independent components given component reliabilities how this joint prior distribution may be based on the combination of expert opinions. A specific system is finally treated numerically. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 741–755, 1997     

On failure modeling

A promising approach to failure modeling, in particular to developing failure-time distributions, is discussed. Under this approach, system state or wear and tear is modeled by an appropriately chosen random process—for example, a diffusion process—and the occurrences of fatal shocks are modeled by a Poisson process whose rate function is state dependent. The system is said to fail when either wear and tear accumulates beyond an acceptable or safe level or a fatal shock occurs. This approach has significant merit. First, it provides revealing new insights into most of the famous and frequently used lifetime distributions in reliability theory. Moreover, it suggests intuitively appealing ways for enhancing those standard models. Indeed, this approach provides a means of representing the underlying dynamics inherent in failure processes. Reasonable postulates for the dynamics of failure should lend credence to the prediction and estimation of reliability, maintainability, and availability. In other words, accuracy of representation could lead to better, more reliable prediction of failure.     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999