bluuebunny/crossref_metadata_2025_split huggingface dataset:
An analysis of the long range operating characteristics of the MIL‐STD‐105D sampling scheme and some suggested modifications
Authors: Brown Gerald G. , Rutemiller Herbert C. 
Published: May 2007

AbstractAn 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.
Calculation of the cost of warranty policies as a function of estimated life distributions
Authors: Blischke Wallace R. , Scheuer Ernest M. 
Published: May 2007

AbstractTwo types of warranties are analyzed. These are the free‐replacement warranty, under which failed items are replaced free of charge until a specified total operating time has been achieved, and the pro rata warranty, under which items that fail prior to a specified time are replaced at pro rata cost to the buyer. Both the buyer's and seller's points of view are considered. The basis of the analysis is a comparison of warranted and unwarranted (otherwise identical) items with regard to long‐run cost to the buyer and long‐run profit to the seller.Application of the results requires knowledge of certain characteristics of the life distribution of the items in question. Parametric and nonparametric methods of estimation of these characteristics from incomplete data are discussed. Single and multiple failure‐mode situations are considered.Some solutions to the problem are illustrated using incomplete data on failure times of an aircraft component.
A note on the optimal scheduling of two parallel processors
Authors: Zaloom Victor , Vatz David 
Published: May 2007

AbstractThe problem of minimizing mean flow time of two parallel processors is discussed. Prior results are briefly reviewed. A dynamic programming algorithm is presented which minimizes mean flow time for a set of n preordered jobs on two nonequivalent parallel processors. The algorithm is illustrated with an example problem. The computational experience is presented which illustrates the efficiency of the algorithm.
Explicit formulas for the order size and reorder point in certain inventory problems
Authors: Das Chandrasekhar 
Published: May 2007

AbstractThis study concentrates on distributions of leadtime demand that permit explicit solution to the lot‐size, reorder point model. The optimal order size for the general case is first expressed as a function of the economic order quantity and a quantity known as the “residual mean life” in reliability theory. The concept of “no aging” is then utilized to identify a broad class of distributions for which the optimal order size can be determined explicitly, independent of the reorder point.
Multiperiod capacity expansion and shipment planning with linear costs
Authors: Fong C. O. , Srinivasan V. 
Published: May 2007

AbstractIn this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non‐decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided.
An algorithm for solving general fractional interval programming problems
Authors: Charnes A. , Granot Daniel , Granot Frieda 
Published: May 2007

AbstractA Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two‐sided linear inequality constraints.In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations.
Solving fixed charge network problems with group theory‐based penalties
Authors: Rardin R. L. , Unger V. E. 
Published: May 2007

AbstractMany well‐known transportation, communication, and facilities location problems in operations research can be formulated as fixed charge network problems, i.e. as minimum cost flow problems on a capacitated network in one commodity where some arcs have both fixed and variable costs. One approach to solving such problems is to use group theoretic concepts from the theory of integer programming to provide bounds for a branch‐and‐bound procedure. This paper presents such a group‐theory based algorithm for exact solution of fixed charge network problems which exploits the special structures of network problems. Computational results are reported for problems with as many as 100 fixed charge arcs.
The normal approximation to the multinomial with an increasing number of classes
Authors: Weiss Lionel 
Published: May 2007

AbstractFor a fixed number of classes and the number of trials increasing, the approach of the multinomial cumulative distribution function to a normal cumulative distribution function is familiar. In this paper we allow the number of classes to increase as the number of trials increases, and show that under certain circumstances the probabilities assigned to arbitrary regions by the multinomial distribution are all close to the probabilities assigned by the distribution of “rounded off” normal random variables. As the number of trials increases, the amount rounded off approaches zero. The result can be used to study the asymptotic distribution of functions of multinomial random variables.
A note on testing for exponentiality
Authors: Harris Carl M. 
Published: May 2007

AbstractIn this note some extensions are made to previous work by a number of authors on the development of tests for exponentiality. The most recent example is due to Fercho and Ringer in which they compare the small sample powers of a few well‐known test statistics for the hypothesis of a constant failure rate. It is the primary intent of this current work to extend Gnedenko's F test to situations with hypercensoring and to provide guidance for its use, particularly when a log‐normal distribution is the alternative.
Optimal flowshop schedules with no intermediate storage space
Authors: Gupta Jatinder N. D. 
Published: May 2007

AbstractIn this paper the problem of finding an optimal schedule for the n‐job, M‐machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed.
Multichannel queueing systems with heterogeneous classes of arrivals
Authors: Bhat U. Narayan , Fischer Martin J. 
Published: May 2007

AbstractIn an integrated telecommunications network, voice and data traffic compete for the same transmission facilities. Assuming Poisson arrivals and exponential service with different rates, analytic expressions are obtained for measures of performance such as blocking probability and average delay under the following operating rule: class 1 traffic behaves as a loss system while class 2 traffic is buffered when all channels are busy. In view of the inordinate amount of computational effort needed when the number of channels is large, simple approximations have been suggested.
An infiltration game with time dependent payoff
Authors: Thomas Marlin U. , Nisgav Yair 
Published: May 2007

AbstractThe problem of assigning patrol boats, subject to resource constraints, to capture or delay an infiltrator with perishable contraband attempting escape across a long, narrow strait is formulated as a two‐sided time sequential game. Optimal mixed strategies are derived for the situation of one patrol boat against one smuggler. Procedures for obtaining numerical solutions for R > 1 patrol boats are discussed.
A survey of maintenance models: The control and surveillance of deteriorating systems
Authors: Pierskalla William P. , Voelker John A. 
Published: May 2007

AbstractThe literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book,The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service.
OPTIMAL FACILITY LOCATION UNDER RANDOM DEMAND WITH GENERAL COST STRUCTURE
Authors: Balachandran V. , Jain Suresh 
Published: May 2007

AbstractThis paper investigates the problem of determining the optimal location of plants, and their respective production and distribution levels, in order to meet demand at a finite number of centers. The possible locations of plants are restricted to a finite set of sites, and the demands are allowed to be random. The cost structure of operating a plant is dependent on its location and is assumed to be a piecewise linear function of the production level, though not necessarily concave or convex. The paper is organized in three parts. In the first part, a branch and bound procedure for the general piecewise linear cost problem is presented, assuming that the demand is known. In the second part, a solution procedure is presented for the case when the demand is random, assuming a linear cost of production. Finally, in the third part, a solution procedure is presented for the general problem utilizing the results of the earlier parts. Certain extensions, such as capacity expansion or reduction at existing plants, and geopolitical configuration constraints can be easily incorporated within this framework.
Some comparative & design aspects of fixed cycle production systems
Authors: Soyster A. L. , Toof D. I. 
Published: May 2007

AbstractA serial production line is defined wherein a unit is produced if, and only if, all machines are functioning. A single buffer stock with finite capacity is to be placed immediately after one of the first N‐1 machines in the N machine line. When all machines have equal probability of failure it is shown that the optimal buffer position is exactly in the middle of the line. This result is synthesized with the earlier work of Koenigsberg and Buzacott including an analysis of the covariance between transition states. An alternative model formulation is presented and integrated with previous results. Finally, a sufficient condition and solution procedure is derived for the installation of a buffer where there is a possible trade‐off between increasing the reliability of the line versus adding a buffer stock.
Estimation of strategies in a markov game
Authors: Filar Jerzy A. 
Published: May 2007

AbstractIn this paper a two‐person Markov game, in discrete time, and with perfect state information, is considered from the point of view of a single player (player A) only. It is assumed that A's opponent (player B) uses the same strategy every time the game is played. It is shown that A can obtain a consistent estimate of B's strategy on the basis of his past experience of playing the game with B. Two methods of deriving such an estimate are given. Further, it is shown that using one of these estimates A can construct a strategy for himself which is asymptotically optimal. A simple example of a game in which the above method may be useful is given.
On multipopulation queuing systems with first‐come first‐served discipline
Authors: Truemper K. 
Published: May 2007

AbstractSteady‐state probabilities for a multipopulation single channel multiserver queuing system with first‐come first‐served queue discipline are established. Special cases lead to simplified formulas which sometimes can be evaluated using existing statistical and/or queuing tables. Optimization aspects are considered involving control of service rates. Several applications are presented.
Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
Authors: Srinivasan V. , Thompson G. L. 
Published: May 2007

AbstractWe consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto‐optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors.
On a constraint qualification in a nondifferentiable programming problem
Authors: Mond Bertram , Schechter Murray 
Published: May 2007

AbstractA mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification. In this note we give a simple geometric characterization to this constraint qualification and show that it is implied by the generalized Slater constraint qualification.
Multivariate tests of fit using asymptotically sufficient grouping
Authors: Weiss Lionel 
Published: May 2007

AbstractA sample is taken from a continuous multivariate distribution. The problem is to test the hypothesis that the unknown joint cumulative distribution function is equal to a completely specified function. The observed data are transformed so that the hypothesis being tested is that the distribution is uniform over a unit hypercube. If only neighboring alternatives are considered, it is shown that the numbers of observations falling in a gradually increasing number of subcubes are asymptotically sufficient. It is shown that for all asymptotic probability calculations, we can assume that the joint distribution of the numbers of observations can be considered to be the distribution of slightly rounded off normal random variables. Tests based on these facts are constructed.
The effect of prior assumptions on the expected cost of m/m/1 queueing systems with unknown arrival rate
Authors: Barzily Zeev , Yadin Micha 
Published: May 2007

AbstractIn this study we deal with the determination of optimal service rate in an M/M/1 queue. The arrival rate is unknown and assumed to be a random variable with a known distribution function. Holding and operating costs are considered and service rate is determined to minimize total expected discounted costs for infinite horizon. The effects of the arrival rate's distribution properties on the characteristics of the system are examined.
Stochastic duels with bursts
Authors: Ancker C. J. 
Published: May 2007

AbstractIn this analysis we extend the theory of stochastic duels to include the situation where one of the contestants fires a single infinitely long burst at a fixed rate of fire and secondly where he fires fixed‐length, fixed‐rate of fire bursts randomly spaced. In both cases the opponent fires single rounds randomly spaced. Special cases and parameter effects are considered.
The effect of correlated exponential service times on single server tandem queues
Authors: Mitchell C. R. , Paulson A. S. , Beswick C. A. 
Published: May 2007

AbstractAn investigation via simulation of system performance of two stage queues in series (single server, first‐come, first‐served) under the assumption of correlated exponential service times indicates that the system's behavior is quite sensitive to departures from the traditional assumption of mutually independent service times, especially at higher utilizations. That service times at the various stages of a tandem queueing system for a given customer should be correlated is intuitively appealing and apparently not at all atypical. Since tandem queues occur frequently, e.g. production lines and the logistics therewith associated, it is incumbent on both the practitioner and the theoretician that they be aware of the marked effects that may be induced by correlated service times. For the case of infinite interstage storage, system performance is improved by positive correlation and impaired by negative correlation. This change in system performance is reversed however for zero interstage storage and depends on the value of the utilization rate for the case where interstage storage equals unity. The effect due to correlation is shown to be statistically significant using spectral analytic techniques. For correlation equal unity and infinite interstage storage, results are provided for two through twenty‐five stages in series to suggest how adding stages affects system performance for ρ>0. In this extreme case of correlation, adding stages has an effect on system performance which depends markedly on the utilization rate. Recursive formulae for the waiting time per customer for the cases of zero, one, and infinite interstage storage are derived.
Single‐lane bridge serving two‐lane traffic
Authors: Eshcoli Z. , Adiri I. 
Published: May 2007

AbstractThis paper presents a mathematical model of a single‐lane bridge serving two‐way traffic in alternating directions (with an FIFO rule observed within each directional queue). While the bridge serves cars moving in one direction, cars approaching from the opposite direction wait in a queue at its foot. When cars in the current direction finish crossing the bridge, it begins serving cars from the other direction, if any are present. A newly‐arrived car finding an empty bridge mounts it immediately. Several cars moving in the same direction may occupy the bridge simultaneously. The crossing speed is assumed to be constant, and the arrival processes in both directions are assumed to be independent, homogeneous Poisson processes. A generalization of the alternating‐priority models [1, 2] is developed to arrive at the Laplace‐Stieltjes transform and the expected value of the flow time (the time interval between the moments of arrival at the bridge and departure from it) for steady state conditions. The results are discussed and some examples are presented graphically.
Optimal control for multi‐servers queueing systems under periodic review
Authors: Huang C. C. , Brumelle S. L. , Sawaki K. , Vertinsky I. 
Published: May 2007

AbstractThis paper deals with the problem of finding the optimal dynamic operating policy for an M/M/S queue. The system is observed periodically, and at the beginning of each period the system controller selects the number of service units to be kept open during that period. The optimality criterion used is the total discounted cost over a finite horizon.
A convex property of an ordered flow shop sequencing problem
Authors: Panwalkar S. S. , Khan A. W. 
Published: May 2007

AbstractA flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure.
A manpower planning/capital budgeting model (MAPCAB)
Authors: Clark Rolf H. , Comerford Robert A. 
Published: May 2007

AbstractA deterministic resource allocation model is developed to optimize defense effectiveness subject to budget, manpower, and risk constraints. The model consists of two major submodels connected by a heuristic. The first is a mathematical program which optimizes the multiperiod weapon mix subject to the constraint set. The second is a manpower supply model based on a transition matrix in which individual transitions are functions of personnel related budgets and historical transition rates. The heuristic marries the submodels through an iterative process leading to improved solutions. An example is provided which demonstrates how systems are undercosted and overprocured if manpower supply is not properly reflected relative to manpower demand.
An F approximation for two‐parameter weibull and log‐normal tolerance bounds based on possibly censored data
Authors: Mann Nancy R. 
Published: May 2007

AbstractAn approximation suggested in Mann, Schafer and Singpurwalla [18] for obtaining small‐sample tolerance bounds based on possibly censored two‐parameter Weibull and lognormal samples is investigated. The tolerance bounds obtained are those that effectively make most efficient use of sample data. Values based on the approximation are compared with some available exact values and shown to be in surprisingly good agreement, even in certain cases in which sample sizes are very small or censoring is extensive. Ranges over which error in the approximation is less than about 1 or 2 percent are determined. The investigation of the precision of the approximation extends results of Lawless [8], who considered large‐sample maximum‐likelihood estimates of parameters as the basis for approximate 95 percent Weibull tolerance bounds obtained by the general approach described in [18]. For Weibull (or extreme‐value) data the approximation is particularly useful when sample sizes are moderately large (more than 25), but not large enough (well over 100 for severely censored data) for asymptotic normality of estimators to apply. For such cases simplified efficient linear estimates or maximum‐likelihood estimates may be used to obtain the approximate tolerance bounds. For lognormal censored data, best linear unbiased estimates may be used, or any efficient unbiased estimators for which variances and covariances are known as functions of the square of the distribution variance.