bluuebunny/crossref_metadata_2025_split huggingface dataset:
A model for procurement, allocation, and redistribution for low demand items
Authors: Hadley G. , Whitin T. M. 
Published: May 2007

AbstractProblems of inventory control for items with extremely low demand (say less than one unit per month average demand) have received relatively little attention in the literature. However, for military supply systems it is well known that an extremely large proportion of the total number of items fall into this category. The problem of designing a control system for these low demand items is therefore one of the most critical inventory management problems faced by the National Military Establishment.In the following, a single echelon, multidepot supply system is studied for low demand items having a stationary Poisson probability distribution for demand. Instantaneous information concerning inventory levels is assumed to be available. Procurement lead time is assumed to be constant as well as the time required for either of two available modes of redistribution. Items are ordered one at a time and decision rules are developed for allocation of new procurement, redistribution of stocks among the depots, and for determining system and depot stockage objectives in order to minimize the expected costs resulting from system and depot stockouts, cost of redistributing stocks among the depots, and costs of transportation from the source. The model is an extension of previous models in that redistribution costs and depot stockout costs are considered in the determination of the stockage objective for the system as a whole. When more than a single unit is on order, the allocation of a unit ready to be delivered is determined by the solution of a dynamic programming problem. When only a single unit is on order (and this is the one ready to be delivered), the optimal allocation procedure is reduced to allocating the unit to the depot which has the greatest probability of using it in a time period T + (1/λ) where T is the procurement lead time and λ the system demand rate for the item.
Multiship, multishop, workload‐smoothing progfum
Authors: Levy F. K. , Thompson G. L. , Wiest J. D. 
Published: May 2007

AbstractThis paper describes a computer program that uses simple rules and applies them probabilistically to minimize manpower requirements in shops of a naval shipyard. Preliminary runs on a small fictitious problem show that this “multiship, multishop, workload‐smoothing” program, called (MS)2, may be able to reduce the maximum number of men required on any one day by 30 to 60 percent.The program employs the critical path method of analyzing the jobs to be done on a given project (ship) and begins by assigning all jobs at their earliest possible start time. Then suitable jobs on peak workload days are selected at random and shifted to later days beyond the peak days until further shifting no longer reduces peak loads. The first segment of the program smooths the workloads on all shops simultaneously. After the first segment is completed the second segment performs further smoothing on individual shops, beginning with the most expensive shop.Although a limited amount of experience has been gained with this program, it appears likely that it can be developed further so that it can handle realistic‐sized problems such as those encountered in a Naval Shipyard. Moreover, it can be applied on three levels: (1) smoothing shop workloads in a shipyard; (2) smoothing the workloads of individual shops; and (3) smoothing shipyard workloads.
Analytical study of a problem in air defense
Authors: Mohan C. , Arora K. L. 
Published: May 2007

AbstractThis paper deals with the analytical study of the encounter of fighter interceptors with the incoming formation of an air task force of enemy bombers. An attempt is made to frame a stochastic model of the situation and to determine the probabilities of hit under different conditions. It is indicated that with reasonable estimates of the operational parameters involved the various probabilities are capable of optimization.
A model for the analysis of aew and cap aircraft availability
Authors: Collins F. I. , Guthrie D. 
Published: May 2007

AbstractAs a carrier taskforce proceeds into an operating area it becomes necessary to launch Anti‐Air Warfare (AAW) aircraft, including Airborne Early Warning (AEW) and possibly Combat Air Patrol (CAP) units. The number of aircraft launched depends on the degree of AAW coverage desired, the time period to be covered, and the availability of aircraft. The principal factors determining the availability of aircraft for such employment are the composition of the aircraft complement and the adequacy of the maintenance facilities. This paper presents an analytical model describing the maintenance operation aboard an aircraft carrier. The model is sufficiently general to permit the evaluation of a wide variety of aircraft types and employment schemes. The model was applied to determining: (1) the maximum feasible airborne complement of AEW and CAP aircraft; and (2) the effect of various intra‐carrier and intercarrier cycling operations in task forces containing more than one carrier. For each of these two examples, the output of the model is a probability distribution of the number of a given type of aircraft that are airborne as a function of time in the operating area. A maximum feasible airborne complement is obtained by assuring that the probability that the full complement is maintained remains about a given standard over the period of the operation. The effect of inter‐carrier coordination is measured by the size of the maximum feasible airborne complement under various situations. Other applications for which the model would be useful are the measurement of sensitivity of AAW aircraft availability to variations on the parameters of maintenance process, and the evaluation of the effect of maintenance limitations of the AAW coverage as requirements increase during the later stages of an operation.
Queuing with reneging and multiple heterogeneous servers
Authors: Ancker C. J. , Cafarian A. V. 
Published: May 2007

AbstractA Poisson stream of items arrive at a multiple parallel serving facility consisting of s heterogeneous servers. The service time density functions are all negative exponential and may all have different means. An arrival balks (refuses to enter) if the queue size is equal to N. If the queue size is less than N, the arrival enters the queue and is served on a first‐come, first‐served basis unless it reneges (leaves the queue). Each entering item has a definite length of time it will wait in queue before reneging. This time is a random variable with negative exponential density function. If on arrival more than one server is free, the server to be used is chosen at random. The results obtained are for steady‐state and include (1) state probabilities; (2) the probability of j or more in system, j=s, s+I,…, s+N; (3) mean number in queue and system and mean number of busy servers; (4) probability that an arrival acquires service; (5) mean rate of loss due to balking and reneging; and (6) density functions and mean values of waiting times in queue for those who are served, those who renege, and all who enter. Certain important special cases are derived from the preceding, namely, (1) unbounded queues, (2) homogeneous servers, (3) no reneging, (4) no reneging and unbounded queues, and (5) single server. Finally, a comparison is made of a heterogeneous system with an equivalent homogeneous system.
Equivalence in nonlinear programming
Authors: Mangasarian O. L. 
Published: May 2007

AbstractThe purpose of this work is to show the relation between the Kuhn‐Tucker and the gradient‐projection conditions for constrained maximization (minimization) problems. A similar relationship exists between Kuhn‐Tucker‐type conditions and gradient‐projection‐type conditions for certain constrained saddle‐point problems. This latter relationship may lead to a computational algorithm for these constrained saddle‐point problems.
Minimax surveillance schedules with partial information
Authors: Roeloffs Robert 
Published: May 2007

AbstractAn analysis is made of the problem of finding the optimal schedule for checking an operating system which is subject to failure detectable only by inspection of the system. If a cost is attached to each inspection of the system and also to undetected failure, then there exists the problem of scheduling inspections to minimize total costs. This problem also exists for the surveillance inspection of stored goods subject to deterioration with time.Previous work by Barlow and Hunter gives the optimal schedules for two special cases — when the failure distribution of the units is known to be exponential, and when it is known to be uniform. Derman has obtained the minimax schedule, that is, the schedule which minimizes the maximum possible expected cost for the case where the failure distribution is entirely unknown.This paper assumes that the location of one percentile of the failure distribution of the units is known, and is concerned with the optimal use of this partial information. The minimax schedule is obtained for the case where the operation is to continue until either a failure is detected, or a stipulated time has elapsed, and comparisons are made with Derman' s results for an unknown distribution.
Surveillance problems: Wiener processes
Authors: Antelman Gordon R. , Savage I. Richard 
Published: May 2007

AbstractThis paper extends the results presented by I. R. Savage in a previous paper [8]. That paper studied economically optimal policies for inspecting and repairing production processes which behave as Poisson processes. Similar results are presented here for production processes which behave as Wiener processes.With continuous surveillance, methods are presented which permit the computation of exactly optimal strategies and the optimal income per unit of time. With costly surveillance, a functional equation is presented. The solution of this equation would yield the optimal strategy. Explicit solutions do not seem feasible but many qualitative properties of the solutions are found. The most interesting of these says, roughly (see Proposition 12 for exact statement), that the time between inspections decreases as the observed quality decreases.
A “static” solution to a “dynamic” problem in acquisition probability
Authors: Rasof Bernard , Abrams Leonard S. 
Published: May 2007

AbstractThis paper reports a novel solution to a special case of a classical problem in operations research, “The probability that an acoustic homing torpedo will ‘acquire’ a submarine”. Because of uncertainties in the position of submarine relative to torpedo an exact kinematic solution to the problem is not possible, and only a probabilistic solution may be obtained. The complicated realistic problem is idealized here to a tractable model by a small number of simplifications; later the effect of removing these simplifications one at a time is examined, and it is made plausible that each has only a small influence on the acquisition probability. As an illustration of the application of the concepts developed, an example in which the submarine is assumed to move radially outward from the torpedo –‐ but otherwise incorporating reasonable assumptions about the kinematics of the torpedo and submarine –‐ is completely solved in detail. In this example the uncertain position of the submarine is given by simple frequency distributions; a more complicated case could be solved by numerical methods. The solution of this specialized problem is particularly interesting because of the immediate and unexpected operational research results which may be inferred.
A statistical study of the derailment hazard for U.S. class I railways
Authors: Koopmans L. H. 
Published: May 2007

AbstractA simple probabilistic model is proposed for the collision and derailment experience for freight trains of U.S. Class I railways. By means of this model, asymptotic confidence intervals are constructed for the probability per mile of a derailment accident as a function of train speed and train length which utilize data available from records for U.S. Class I railways kept by the Interstate Commerce Commission and the Association of American Railroads [l]. Allowance is made in the model for the grouping of data by train length and speed.The theory is applied to a particular summary of accident data for all U.S. Class I railways for the years 1952 through 1955. On the basis of this data, confidence intervals for the derailment probability are computed for speeds in excess of 10 mph and train lengths of from 11 to 130 cars in groups of 5 cars. In addition, a statistical test of one of the more crucial model hypotheses is performed.An appendix containing the relevant derivations is included. In particular, a new version of a theorem of Slutsky due to LeCam is stated which greatly facilitates the derivations of the asymptotic distributions for the estimates of the derailment probabilities and the statistic employed in the above mentioned hypothesis test.
A theater materiel model
Authors: Bracken J. , Brossman M. W. , Magruder C. B. , Tholen A. D. 
Published: May 2007

AbstractThis paper summarizes a theater‐level materiel model which has been developed for the Army as a part of a system for gaming or simulating the military aspects of theater, inter‐theater and continental United States (CONUS) logistics.For purposes of military analysis and computational convenience, the theater under study is divided into geographical subdivisions (i.e., regions) and the military operation is divided into a succession of time periods of specified length. The model operates through one complete cycle for each time period.A cycle starts with the actual materiel status at the beginning of the period in the theater and in each region. (Depending on the problem presented, the “actual materiel status” at the beginning of the period can be either the actual status now pertaining or one that is assumed for the purpose of the problem.) The model applies changes that take place during the period and computes the actual materiel status at the end of the period for the theater and for each region. Authorized materiel status at the end of the period is computed for the theater and for each region, The authorized materiel status is compared with the actual materiel status and the imbalances are computed.The model forecasts the materiel expected to be consumed in the next period in the theater and in each region. It determines the materiel movements by source and destination which should take place in the next time period to correct the imbalances from the preceding time period and provide whatever replacement is necessary for meeting forecasted consumption in the next time period so as to leave each region with its authorized stockage at the end of the next period.Requisitions for materiel to arrive in the order and shipping time are computed using forecasts of consumption and receipts. This completes the cycle.The model described in this paper has been programmed and utilized in war games for the Department of Army and in a special study for the Department of Defense. It should be useful for a wide range of applications, including developing logistic constraints in combat games, and designing and evaluating logistic systems.
The formulation of some allocation and connection problems as integer programs
Authors: Breuer Melvin A. 
Published: May 2007

AbstractIn this paper a component placement problem and a digital computer backboard wiring problem are formulated as integer linear programs. The component placement problem consists of making a unique assignment of components to column positions such that wireability is maximized. The backboard wiring problem consists of three interrelated subproblems, namely, the placement, the connection, and the routing problems. The placement and connection problems are combined and solved as one, thereby giving the optimal circuit connections as well as minimizing the total lead length. It is shown that under certain assumptions, the number of inequalities and variables in the problem can be greatly reduced. Further simplifying assumptions lead to a near optimal solution.Examples of other allocation problems to which the models presented here are applicable are given.The following concepts are formulated as linear inequalities: (1) the absolute magnitude of the difference between two variables; (2) minimize the minimum function of a set of functions; and (3) counting the number of (0, 1) adjacent component pairs in a vector.
Some test functions for the parameters of the weibull distributions
Authors: Dubey Satya D. 
Published: May 2007

AbstractTest functions, based on various types of censored and noncensored data, for testing several hypotheses about the location, the scale, and the shape parameters of the Weibull distributions are proposed. The exact sampling distributions of these test statistics are derived and their properties in special cases are discussed. A numerical example is considered to illustrate the application of the test functions. The results of this paper possess good possibility of wide application in view of the fact that hosts of real data arising from diverse fields of human endeavor are adequately described by the Weibull distribution.
Values for optimum reject allowances
Authors: Delfausse J. , Saltzman S. 
Published: May 2007

AbstractIndustrial situations exist where it is necessary to estimate the optimum number of parts to start through a manufacturing process in order to obtain a given number of completed good items. The solution to this problem is not straightforward when the expected number of rejects from the process is a random variable and when there are alternative penalties associated with producing too many or too few items. This paper discusses various aspects of this problem as well as some of the proposed solutions to it. In addition, tables of optimum reject allowances based on a comprehensive model are presented.
A bibliography of search theory and reconnaissance theory literature
Authors: Enslow Philip H. 
Published: May 2007

AbstractThis bibliography consists of 75 items on search theory and reconnaissance theory found in periodicals and technical reports. Each entry includes a short summary or a quotation from the pertinent abstract. The items are classified into one or more of the following categories: (1) General Discussion of Problems; (2) Allocation of Effort; (3) Game Theory Formulations; (4) Geometric Search Patterns; (5) Measures of Performance and (6) Miscellaneous.
Statistical decision analysis of stochastic linear programming problems
Authors: Bracken Jerome , Soland Richard M. 
Published: May 2007

AbstractThis paper presents a statistical decision analysis of a one‐stage linear programming problem with deterministic constraints and stochastic criterion function. Procedures for obtaining numerical results are given which are applicable to any problem having this general form. We begin by stating the statistical decision problems to be considered, and then discuss the expected value of perfect information and the expected value of sample information. In obtaining these quantities, use is made of the distribution of the optimal value of the linear programming problem with stochastic criterion function, and so we discuss Monte Carlo and numerical integration procedures for estimating the mean of this distribution. The case in which the random criterion vector has a multivariate Normal distribution is discussed separately, and more detailed methods are offered. We discuss dual problems, including some relationships of this work with other work in probabilistic linear programming. An example is given in Appendix A showing application of the methods to a sample problem. In Appendix B we consider the accuracy of a procedure for approximating the expected value of information.
A tactical warfare simulation program
Authors: Fain W. W. , Fain Janice B. , Karr H. W. 
Published: May 2007

AbstractThe Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical‐area, sequence‐of‐event model and is programmed in SIM‐SCRIPT.In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented.
Some rectangular games with a two‐man team
Authors: Jackson James R. 
Published: May 2007

AbstractCertain zero‐sum games are examined in which an individual player is opposed by a two‐man team. The members of the team have identical interests, but must act separately during play. Most of the paper is devoted to instances in which one teammate has an opportunity to communicate to the other about their mutual opponent's strategy; but he may only be able to transmit a limited amount of information and his choice of a “message” may affect the payoff. The team must thus make economically efficient use of a limited communication opportunity. The present paper treats a variety of models, all of which are formulated as rectangular (matrix) games. Related models, some of which cannot be so formulated either because of restrictions on the team's opportunities to use mixed strategies or because they are non‐zero‐sum games, will be treated in another paper.
A queuing process with bilevel hysteretic service‐rate control
Authors: Gebhard Richard F. 
Published: May 2007

AbstractThe purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed.
Normal and weibull distributions
Authors: Dubey Sat Ya D. 
Published: May 2007

AbstractNumerous applications of the Weibull distribution in diverse fields of human endeavor are well known today. Nevertheless, it is not uncommon to find applications of the normal distribution in such fields of studies as agriculture, biology, chemistry, engineering, physics, sociology and others. At the present time we have at our disposal many more refined statistical techniques for analyzing the normal rather than the Weibull data. Consequently, it is important for applied statisticians to know if some of their data which can be described by the Weibull distribution can also be described by the normal distribution. The present investigation of the author reveals that the normal distri,bution can be considered to be a good approximation to the Weibull distribution as long as its shape parameter is in the open interval (3.25, 3.61). This fact enables them to perform a refined statistical analysis of their data. Conversely, they can now easily compute the desired normal cumulative probabilities from the Weibull distribution function, which would be especially helpful for those standard normal deviates whose cumulative probabilities cannot be read from the available tables of normal cumulative probability. In a similar situation they can also use the Weibull distribution to obtain an approximation to any desired normal deviate for a given normal probability which may be better than those obtained by the linear interpolation method.