bluuebunny/crossref_metadata_2025_split huggingface dataset:
Optimization of strategic defenses to provide specified post‐attack production capacities
Authors: Bracken Jerome , McGill James T. 
Published: May 2007

AbstractThis paper presents a model for choosing a minimum‐cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques.
Properties of an approximate hazard transform
Authors: Esary J. D. , Hayne W. J. 
Published: May 2007

AbstractThe calculation of the exact reliability of complex systems is a difficult and tedious task. Consequently simple approximating techniques have great practical value.The hazard transform of a system is an invertible transformation of its reliability function which is convenient and useful in both applied and theoretical reliability work. A simple calculus for finding an approximate hazard transform for systems formed by series and parallel combinations of components is extended so that it can be used for any coherent system. The extended calculus is shown to lead to conservative approximations.A first order version of the extended calculus is also discussed. This method of approximation is even more simple to use, but is not always conservative. Examples of its application indicate that it is capable of giving quite accurate results.
Optimal schedules for special structure flowshops
Authors: Gupta Jatinder N. D. 
Published: May 2007

AbstractThis paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well‐defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large‐sized problems even with manual computational devices.
An operator theory of parametric programming for the generalized transportation problem‐III‐weight operators
Authors: Balachandran V. , Thompson G. L. 
Published: May 2007

AbstractThis paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis‐preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper.
A computation procedure for the exact solution of location‐allocation problems with rectangular distances
Authors: Love Robert F. , Morris James G. 
Published: May 2007

AbstractA method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p‐median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p‐median problem.
Approximations for the consolidation of multiechelon repair facilities
Authors: Morey Richard C. 
Published: May 2007

AbstractThis 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.
Bayesian estimation: A sensitivity analysis
Authors: Canavos George C. 
Published: May 2007

AbstractThe robustness of the assigned prior distribution in a Bayesian estimation problem is examined. A Bayesian analysis for a stochastic intensity parameter of a Poisson distribution is summarized in which the natural conjugate is assigned as the prior distribution of the random parameter. The sensitivity analysis is carried out by assuming the existence of a true prior which is different in form from that of the assigned prior distribution. By using mean‐squared error as a measure of performance, the ensuing Bayes decision function is compared to the corresponding minimum variance unbiased estimator. Results indicate that the Bayes estimator is largely robust to deviations from the assigned prior and remains squared‐error superior to the MVU type within a broad region.
Control charts for exponentially distributed product life
Authors: Yegulalp Tuncel M. 
Published: May 2007

AbstractThis paper introduces a special control chart procedure for exponentially distributed product life. Statistical control of product life in manufacturing requires continuing life tests of manufactured product so as to detect changes in product life and take appropriate corrective action. These life testing experiments may become exceedingly time consuming and thus can be both impractical because of serious time delays in implementing corrective action on the process when indicated, and quite uneconomical.It is desirable to inquire into the character of life testing by means of a control chart procedure based on the real time to first failure within given samples. Measuring the real minimum life provides a considerable reduction in duration of the testing procedure and in the number of specimens destroyed, yielding a considerable economy over the Shewhart's X control chart.
Approximate probability distributions for the extreme spread
Authors: Taylor Malcolm S. , Grubbs Frank E. 
Published: May 2007

AbstractThe extreme spread, or greatest distance between all pairs of impact points on a target, is often used as a rapid measure of dispersion or precision of shot groups on a target. It is therefore desirable to know its statistical properties. Since the exact theoretical distribution has not yet been worked out, this paper examines the accuracy of several approximations which are checked against large sample monte carlo values. We find in particular that for the sample sizes considered the extreme spread can be approximated well by a Chi variate.
Optimal inventory policy when stockouts alter demand
Authors: Caine G. J. , Plaut R. H. 
Published: May 2007

AbstractAn inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set‐up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail.
Scheduling to minimize the weighted sum of completion times with secondary criteria
Authors: Burns Richard N. 
Published: May 2007

AbstractA result of Smith previously published in this journal [3], on the use of secondary criteria in scheduling problems, is shown to be incorrect and a counter example is presented.Heck and Roberts [2] suggested that their paper would be extended in the same way Smith's algorithm was. A new algorithm is given that converges to a local optimum for both problems.
Redundant spares allocation to reduce reliability costs
Authors: Shaw Leonard , Sinkar Sharad G. 
Published: May 2007

AbstractThe problem considered here is the optimal selection of the inventory of spares for a system built from two kinds of modules, the larger of which can be connected so it performs the role of the smaller one. The optimal inventory is the least costly one which achieves a specified probability that the spares will not be exhausted over the design lifetime. For some costs and failure rates it is most economical to use the larger module for both roles, due to the resulting increase in flexibility in the deployment of a single type of spare module.Both analytical and simulation methods have been used to study this problem.
An asymptotically optimal inspection policy
Authors: Anbar Dan 
Published: May 2007

AbstractAn inspection model in life testing situations is discussed. The system under study is assumed to consist on n independent components all of which fail independently in an exponential fashion. Failures can be discovered only through inspection. The experimenter is assumed to lack the knowledge of the parameter of the exponential distribution. A stochastic sequential inspection policy is suggested which uses the data collected through experimentation to estimate the unknown parameter. It is shown that this policy is asymptotically optimal. Some numerical demonstrations are included.
A dynamic nonlinear constrained optimal replacement model
Authors: Kalman Peter J. , Wickström Bengt‐Arne 
Published: May 2007

AbstractA stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age.The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail.
A two‐echelon inventory model with purchases, dispositions, shipments, returns and transshipments
Authors: Hoadley Bruce , Heyman Daniel P. 
Published: May 2007

AbstractThis paper presents a one‐period two‐echelon inventory model with one warehouse in the first echelon and n warehouses in the second echelon. At the beginning of the period the stock levels at all facilities are adjusted by purchasing or disposing of items at the first echelon, returning or shipping items between the echelons and transshipping items within the second echelon. During the period, demands (which may be negative) are placed on all warehouses in the second echelon and an attempt is made to satisfy shortages either by an expedited shipment from the first echelon to the second echelon or an expedited transshipment within the second echelon. The decision problem is to choose an initial stock level at the first echelon (by a purchase or a disposition) and an initial allocation so as to minimize the initial stock movement costs during the period plus inventory carrying costs and system shortage costs at the end of the period.It is shown that the objective function takes on one of four forms, depending on the relative magnitudes of the various shipping costs. All four forms of the objective function are derived and proven to be convex.Several applications of this general model are considered. We also consider multi‐period extensions of the general model and an important special case is solved explicitly.
Cyclical job sequencing on multiple sets of identical machines
Authors: Stern Helman I. , Rodriguez Edgardo P. , Utter Merlin L. 
Published: May 2007

AbstractThe problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r−1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0‐1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented.
A priori error bounds for procurement commodity aggregation in logistics planning models
Authors: Geoffrion A. M. 
Published: May 2007

AbstractA complete logistical planning model of a firm or public system should include activities having to do with the procurement of supplies. Not infrequently, however, procurement aspects are difficult to model because of their relatively complex and evanescent nature. This raises the issue of how to build an overall logistics model in spite of such difficulties. This paper offers some suggestions toward this end which enable the procurement side of a model to be simplified via commodity aggregation in a “controlled” way, that is, in such a manner that the modeler can know and control in advance of solving his model how much loss of accuracy will be incurred for the solutions to the (aggregated) overall model.
A node covering algorithm
Authors: Balas Egon , Samuelsson Haakon 
Published: May 2007

AbstractThis paper describes a node covering algorithm, i.e., a procedure for finding a smallest set of nodes covering all edges of an arbitrary graph. The algorithm is based on the concept of a dual node‐clique set, which allows us to identify partial covers associated with integer dual feasible solutions to the linear programming equivalent of the node covering problem. An initial partial cover with the above property is first found by a labeling procedure. Another labeling procedure then successively modifies the dual node‐clique set, so that more and more edges are covered, i.e., the (primal) infeasibility of the solution is gradually reduced, while integrality and dual feasibility are preserved. When this cannot be continued, the problem is partitioned and the procedure applied to the resulting subproblems. While the steps of the algorithm correspond to sequences of dual simplex pivots, these are carried out implicitly, by labeling. The procedure is illustrated by examples, and some early computational experience is reported. We conclude with a discussion of potential improvements and extensions.
Estimation of ordered parameters from k stochastically increasing distributions
Authors: Chen Hubert J. 
Published: May 2007

AbstractThere are given k (⩾ 2) univariate cumulative distribution functions (c.d.f.'s) G(x; θi) indexed by a real‐valued parameter θi, i=1,…, k. Assume that G(x; θi) is stochastically increasing in θi. In this paper interval estimation on the ith smallest of the θ's and related topics are studied. Applications are considered for location parameter, normal variance, binomial parameter, and Poisson parameter.
Force‐annihilation conditions for variable‐coefficient lanchester‐type equations of modern warfare
Authors: Taylor James G. , Comstock Craig 
Published: May 2007

AbstractThis paper develops a mathematical theory for predicting force annihilation from initial conditions without explicitly computing force‐level trajectories for deterministic Lanchester‐type “square‐law” áttrition equations for combat between two homogeneous forces with temporal variations in fire effectivenesses (as expressed by the Lanchester attrition‐rate coefficients). It introduces a canonical auxiliary parity‐condition problem for the determination of a single parity‐condition parameter (“the enemy force equivalent of a friendly force of unit strength”) and new exponential‐like general Lanchester functions. Prediction of force annihilation within a fixed finite time would involve the use of tabulations of the quotient of two Lanchester functions. These force‐annihilation results provide further information on the mathematical properties of hyperbolic‐like general Lanchester functions: in particular, the parity‐condition parameter is related to the range of the quotient of two such hyperbolic‐like general Lanchester functions. Different parity‐condition parameter results and different new exponential‐like general Lanchester functions arise from different mathematical forms for the attrition‐rate coefficients. This theory is applied to general power attrition‐rate coefficients: exact force‐annihilation results are obtained when the so‐called offset parameter is equal to zero; while upper and lower bounds for the parity‐condition parameter are obtained when the offset parameter is positive.
A note on distribution‐free tolerance limits
Authors: Govindarajulu Z. 
Published: May 2007

AbstractThis note presents methods for solving for any one of the four parameters (such as sample size) involved in the construction of distribution‐free tolerance limits in terms of the other three. These solutions are based on a normal approximation to the incomplete beta function. Numerical examples indicate that the approximations are very reasonable. Also considered are tolerance limits with a specified precision.
A parallel sequencing algorithm for minimizing total cost
Authors: Rajaraman M. K. 
Published: May 2007

AbstractThe problem of sequencing jobs on parallel processors when jobs have different available times, due dates, penalty costs and waiting costs is considered. The processors are identical and are available when the earliest job becomes available and continuously thereafter. There is a processor cost during the period when the processor is available for processing jobs. The proposed algorithm finds the sequence (or sequences) with minimum total cost (sum of waiting, penalty and processor costs.). A proof of the algorithm and numerical results are given.
Adaptive forecasting of the size of a work force subject to random withdrawals
Authors: Zacks S. , Haber S. E. 
Published: May 2007

AbstractAdaptive forecasting procedures are developed for predicting the size of a work force which is subject to random withdrawals. The procedures are illustrated using Marine Corps data in which four stages of service for incoming cohorts are distinguished. Using these data, three forecasting procedures—conditional maximum likelihood estimation of prediction intervals; tolerance intervals; and Bayes prediction intervals—are compared.
Explicit steady state solutions for a particular M(x)/M/1 queueing system
Authors: Jensen George L. , Paulson Albert S. , Sullo Pasquale 
Published: May 2007

AbstractAn explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.
On the aggregation of preferences
Authors: Rödding Walburga , Nachtkamp Hans H. 
Published: May 2007

AbstractThe article attempts to show how network theory may be applied to gain new and better insights into basic economic problems. Starting with a precise definition of what is meant by acting and, in particular, by economic acting, we direct the line of argumentation toward solving the problem of how to aggregate economic decisions. Results indicate that network theory might well prove itself to be a powerful instrument in developing a theory of human behavior much more comprehensive than currently used models.
Weibull tolerance intervals associated with moderate to small survival proportions for use in a new formulation of lanchester combat theory
Authors: Mann Nancy R. 
Published: May 2007

AbstractGiven herein is an easily implemented method for obtaining, from complete or censored data, approximate tolerance intervals associated with the upper tail of a Weibull distribution. These approximate intervals are based on point estimators that make essentially most efficient use of sample data. They agree extremely well with exact intervals (obtained by Monte Carlo simulation procedures) for sample sizes of about 10 or larger when specified survival proportions are sufficiently small. Ranges over which the error in the approximation is within 2 percent are determined.The motivation for investigation of the methodology for obtaining the approximate tolerance intervals was provided by the new formulation of Lanchester Combat Theory by Grubbs and Shuford [3], which suggests a Weibull assumption for time‐to‐incapacitation of key targets. With the procedures investigated herein, one can use (censored) data from battle simulations to obtain confidence intervals on battle times associated with given low survivor proportions of key targets belonging to either specified side in a future battle. It is also possible to calculate confidence intervals on a survival proportion of key targets corresponding to a given battle duration time.
A mathematical programming approach to the scheduling of sorting operations
Authors: Murphy Frederic H. , Stohr Edward A. 
Published: May 2007

AbstractIn this paper we describe an approach to the scheduling and/or real‐time control of sorting operations in the presence of deadlines. The problem arises in the postal service where mail has to be sorted by zip codes, and in the banking system where checks have to be sorted according to the bank on which they are drawn. In both applications losses are incurred if items miss their clearing deadlines. For example, in check‐sorting an extremely important objective of the control system is to reduce the “float” i.e., the total dollar value of the checks which miss their deadlines. The proposed real‐time control system utilizes a linear program which chooses between alternative sort‐patterns and assigns the various processing steps to the time periods between deadlines.
On convexity proofs in location theory
Authors: Love Robert F. , Morris James G. 
Published: May 2007

AbstractIt is often assumed in the facility location literature that functions of the type øi(xi, y) = βi[(xi‐x)2+(yi‐y)2]K/2 are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given.