Insurance type item provisioning guidelines

Policy decisions for insurance type items, where zero or one unit is maintained at the depot, are more difficult and more critical than decisions for common supply items. This report presents results of developing initial provisioning guidelines for insurance type items. The guidelines are based on examination of lifetime costs and benefits. Costs of stocking an item as compared with not stocking are developed through a sinking fund annual payment formulation. Benefits of stocking are developed as stationary reduction in time weighted backorders experienced. A resource allocation formulation yields an optimal policy for allocating a fixed budget. The guideline is presented with refinements based on a sample of items. A figure of merit is calculated for each item, and if it is large the item is stocked while if small it is not stocked. Empirical definitions for large and small are developed based on sample data. Estimation techniques are discussed for deriving all of an item's parameters needed to compute its figure of merit. A Bayes procedure is suggested based on family group Experienced Demand Replacement Factors. This and other techniques are discussed.     

Approximations for the consolidation of multiechelon repair facilities

This paper develops and illustrates an approximate approach for analytically assessing the impacts on both costs and service of consolidation of repair facilities. The repair facilities are two echelon generalizations of the classical repairmen problem in which two types of failures, say major and minor, can occur, each type requiring repair at a different echelon: The questions addressed are the reductions possible in spares, repairmen, and service rates due to the consolidated system's increased efficiency, as well as the physical separation between the users and the consolidated repair facility that is economical. The method of analysis is based upon asymptotic approximations developed for the repairmen problem, valid when the number of operational equipments is large (greater than 50); it is helpful since it provides a tractable means for predicting the steady-state performance of the decentralized and consolidated installations as a function of the many parameters involved without having to resort to an exhaustive computation of all the exact steady-state probabilities.     

An analysis of the long range operating characteristics of the MIL-STD-105D sampling scheme and some suggested modifications

An integral part of the MIL–STD–105D scheme for sampling inspection by attributes is the transfer from normal inspection to reduced or tightened inspection when the historical record of inspected lots suggests unusually good or bad quality. The switching rules in MIL–STD–105D have been criticized, especially by Japanese manufacturers, as being too severe when what is defined as acceptable quality material is submitted. This paper examines the long range fraction of lots rejected for several MIL–STD–105D sampling plans by using the MIL–STD–105D switching rules, using a modification suggested by the Japanese Standards Association, and by using a second modification developed by the authors. The Japanese Standards Association switching rules are more complex than those in MIL–STD–105D. It is demonstrated that they lead to improved long–range properties for Normal–Tightened–Reduced schemes, but to poorer properties for Normal–Tightened schemes. A simplified set of switching rules is suggested, wherein the “limit numbers” in MIL–STD–105D are eliminated. In comparison to MIL–STD–105D, the simpler rules lead to a lower probability of rejection for good lots and a comparable probability of rejection for bad lots.     

Bounds on parallel-processing of queues with multiple-phase jobs

Currently, both the hardware and software designs of many large computing systems aim at improved system performance through exploitation of parallelism in multiprocessor systems. In studying these systems, mathematical modelling and analysis constitute an important step towards providing design tools that can be used in building such systems. With this view the present paper describes a queueing model of a multiprocessor system operating in a job-shop environment in which arriving jobs consist of a random number of segments (sub-jobs). Two service disciplines are considered: one assumes that the sub-jobs of a given job are capable of parallel operation on different processors while the other assumes that the same sub-jobs must be operated in a strictly serial sequ'snce. The results (in particular, the mean number in the system and waiting time in queue) obtained for these two disciplines are shown to be bounds for more general job structures.     

Toward a study of bidding processes part IV - games with unknown costs

This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric.     

On maximization of the integral of a bell-shaped function over a symmetric set

Given a target T in Euclidean n-space Rⁿ and a point bomb whose point of impact in Rⁿ is governed by a probability distribution about the aim point a, what choice of a maximizes the probability of a hit v_a(T)? Of course, only in special cases is an exact solution of this problem obtainable. This paper treats targets T which are symmetric about the origin o and demonstrates conditions on the extent of T and the impact density f, a density with respect to Lebesgue measure, sufficient for v_a(T) to be monotone in the distance from a to o and maximized at a = o. The results are applied to various tactical situations.     

A graph theoretic interpretation of the sufficiency conditions for the contiguous-binary-switching (CBS)-rule

A sufficient condition for the optimality of the CBS-rule due to W. Smith is given a graphic interpretation in terms of ‘convex’ graphs. A convex graph is uniquely constructed (except for a homomorphism), and has the property that the optimum is achieved from any starting point.     

The payment scheduling problem

Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0.