bluuebunny/crossref_metadata_2025_split huggingface dataset:
On a generalized bin‐packing problem
Authors: Lewis R. T. , Parker R. G. 
Published: May 2007

AbstractIn this paper we address a bin‐packing problem which possesses a variety of modifications of the classic theme. Among these are bin‐dependent chip weights, bin costs, and bin‐dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch‐and‐bound framework in order to solve the problem after which substantial computational experience is provided.
A combined approach to solve binary multicriteria problems
Authors: Bitran Gabriel R. , Rivera Jorge M. 
Published: May 2007

AbstractAn implicit enumeration algorithm is developed to determine the set of efficient points in zero‐one multiple criteria problems. The algorithm is specialized for the solution of a particular class of facility location problems. The procedure is complemented with the use of the utility function of the decision maker to identify a subset of efficient point candidates for the final selection. Computational results are provided and discussed.
The discrete search problem and the construction of optimal allocations
Authors: Wegener Ingo 
Published: May 2007

AbstractSuppose one object is hidden in the k‐th of n boxes with probability p(k). The boxes are to be searched sequentially. Associated with the j‐th search of box k is a cost c(j,k) and a conditional probability q(j,k) that the first j ‐ 1 searches of box k are unsuccessful while the j‐th search is successful given that the object is hidden in box k.The problem is to maximize the probability that we find the object if we are not allowed to offer more than L for the search. We prove the existence of an optimal allocation of the search effort L and state an algorithm for the construction of an optimal allocation. Finally, we discuss some problems concerning the complexity of our problem.
Search techniques for a nonlinear multiprocessor scheduling problem
Authors: Price Camille C. , Pooch Udo W. 
Published: May 2007

AbstractThe problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero‐one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non‐backtracking branch‐and‐bound algorithm is described that uses a local neighborhood search at each stage of the search graph.
Least‐absolute‐deviations position finding
Authors: Book Stephen A. 
Published: May 2007

AbstractPosition finding has historically been carried out by calculating the coordinates of the mean position via a least‐squares procedure based on the distance of the position from several direction lines. It has been suggested that the least‐squares procedure assigns too much weight to outliers among the set of direction lines, outliers which may actually be associated with objects other than the one being located. In this paper, a method of using least‐absolute deviations, which yields a more outlier‐resistant median estimate of the position instead of the least‐squares mean estimate, is presented.
Production‐location problems
Authors: Hurter Arthur P. , Venta Enrique R. 
Published: May 2007

AbstractThe joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem variations. The stability of the optimal location in the face of changes in problem parameters is also discussed. It is demonstrated that consideration of input substitutability often makes the resulting problem no more difficult to solve than problem formulations in which the inherent input substitutability is ignored.
Econometric forecasting via discounted least squares
Authors: Agnew Robert A. 
Published: May 2007

AbstractSimple direct smoothing formulas are derived for updating coefficient estimates and forecasts in a discounted least squares model. These formulas are the natural extensions of R. G. Brown's well‐known smoothing formulas to a general econometric setting with arbitrary explanatory time series. The recursive updating process and its forecast error properties are illustrated via a simple, yet realistic numerical example.
Spares stocking policies for repairable items with dependent repair times
Authors: Scudder Gary D. , Hausman Warren H. 
Published: May 2007

AbstractThis paper analyzes the problem of determining desirable spares inventory levels for repairable items with dependent repair times. The problem is important for repairable products such as aircraft engines which can have very large investment in spares inventory levels. While existing models can be used to determine optimal inventory spares levels when repair times are independent, the practical considerations of limited repair shop capacity and prioritized shop dispatching rules combine to make repair times not independent of one another. In this research a simulation model of a limited capacity repair facility with prioritized scheduling is used to explore a variety of heuristic approaches to the spares stocking decision. The heuristics are also compared with use of a model requiring independent repair times (even though that assumption is not valid here). The results show that even when repair time dependencies are present, the performance of a model which assumes independent repair times is quite good.
The outfit planning problem: Production planning in shipbuilding
Authors: Graves R. J. , McGinnis L. F. 
Published: May 2007

AbstractShipbuilding as currently practiced in U.S. commercial shipyards employs little quantitative modeling or analysis in production planning. This paper presents a brief discussion of the shipbuilding process and focuses on one major component which is referred to as outfitting. The outfit planning problem is described in detail and then formally modeled as a generalization of the resource constrained project scheduling problem. The value of the approach as well as barriers to its adoption are also discussed.
Selecting among weibull, lognormal and gamma distributions using complete and censored smaples
Authors: Siswadi  , Quesenberry C. P. 
Published: May 2007

AbstractIn a recent paper, Kent and Quesenberry [19] considered using certain optimal invariant statistics to select the best fitting member of a collection of probability distributions using complete samples of life data. In the present work extensions of this approach in two directions are given. First, selection for complete samples based on scale and shape invariant statistics is considered. Next, the selection problem for type I censored samples is considered, and both scale invariant and maximum likelihood selection procedures are studied. The two‐parameter (scale and shape) Weibull, lognormal, and gamma distributions are considered and applications to real data are given. Results from a (small) comparative simulation study are presented.
A time series analysis of some interrelated logistics performance variables
Authors: Singpurwalla Nozer D. , Talbott Carlos M. 
Published: May 2007

AbstractThis paper is a case study. We show how the powerful methods of time series analysis can be used to investigate the interrelationships between Alert Availability, a logistics performance variable, and Flying Hours, an operational requirement, in the presence of a major change in operating procedures and using contaminated data. The system considered is the fleet of C‐141 aircraft of the U.S. Air Force. The major change in operating procedures was brought about by what is known as Reliability Centered Maintenance, and the contaminated data were due to anomalies in reporting procedures. The technique used is a combination of transfer function modeling and intervention analysis.
Application of level crossing analysis to discrete state processes in queueing systems
Authors: Shanthikumar J. G. , Chandra M. Jeya 
Published: May 2007

AbstractIn this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems.
A sampling procedure and public policy
Authors: Lieberman G. J. , Olkin I. , Riddle F. 
Published: May 2007

AbstractThis paper describes the background of the Office of Management Budget Circular A‐21, “Principles for Determining Costs Applicable to Grants, Contracts, and Other Agreements with Educational Institutions,” that describes the requirement for effort reporting. A sampling procedure is proposed as an alternative to 100% reporting.
Some limiting distributions associated with sequences of multinomial trials
Authors: Arnold B. C. , Angus J. E. 
Published: May 2007

AbstractA series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k−1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed.
Computing demand properties at the wholesale warehouse level
Authors: Schultz Carl R. 
Published: May 2007

AbstractComputational formulas are given for the mean, variance, and autocorrelation function of the demand process at an upper‐echelon facility (warehouse). The demand process at the warehouse is induced by the aggregated inventory replenishment processes of N independently operated lower‐echelon facilities (stores) in parallel. Each store, we assume, employs an (s,S) inventory replenishment policy with complete backlogging to satisfy its own random, independently and identically distributed demand. The formulas result from an analysis of the stochastic replenishment process at a single store. Examples of the properties of the demand process at the upper‐echelon facility are presented for several lower‐echelon environments.
Approximate decision rules for continuous review inventory systems
Authors: Gardner Everette S. 
Published: May 2007

AbstractConstrained multi‐item inventory models have long presented signifcant computational problems. This article presents a general algorithm to obtain simultaneous solutions for order quantities and safety stocks for each line item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Computational experience is presented that demonstrates the algorithm's efficiency in handling large‐scale applications. Decision rules for several customer service objectives are developed, with a discussion of the characteristics of the inventory systems in which each objective would be most appropriate. The decision rules are approximations, based on the assumptions commonly used in practice.
The traveling salesman problem: An update of research
Authors: Parker R. G. , Rardin R. L. 
Published: May 2007

AbstractDuring the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst‐case bounds.
A multifacility capacity expansion model with joint expansion set‐up costs
Authors: Luss Hanan 
Published: May 2007

AbstractThis article describes a multifacility capacity expansion model in which the different facility types represent different quality levels. These facility types are used to satisfy a variety of deterministic demands over a finite number of discrete time periods. Applications for the model can be found in cable sizing problems associated with the planning of communication networks. It is assumed that the cost function associated with expanding the capacity of any facility type is concave, and that a joint set‐up cost is incurred in any period in which one or more facilities are expanded. The model is formulated as a network flow problem from which properties associated with optimal solutions are derived. Using these properties, we develop a dynamic programming algorithm that finds optimal solutions for problems with a few facilities, and a heuristic algorithm that finds near‐optimal solutions for larger problems. Numerical examples for both algorithms are discussed.
“simple‐approximate” battle‐outcome‐prediction conditions for variable‐coefficient lanchester‐type equations of modern warfare
Authors: Taylor James G. 
Published: May 2007

AbstractThis article considers combat between two homogeneous forces modeled by variable‐ coefficient Lanchester‐type equations of modern warfare and develops new “simple‐approximate” battle‐outcome‐prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed‐force‐level‐breakpoint battles and fixed‐force‐ratio‐breakpoint battles). These battle‐outcome‐prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force‐level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition‐rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable‐coefficient Lanchester‐type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is range dependent) being examined in detail.
Multivariate dependent relevations with applications, and related topics
Authors: Johnson Norman L. , Kotz Samuel 
Published: May 2007

Abstract“Relevation” is the name given by Krakowski to the distribution of failure time of a replacement from an aging stock. The present authors have extended this concept to include (i) hierarchal replacement systems and (ii) dependence between lifetimes of original and replacement items. In this article, we present some further developments, including first steps toward a synthesis of (i) and (ii).
The continuous multiple‐modular design problem
Authors: Shaftel Timothy L. , Thompson Gerald L. 
Published: May 2007

AbstractIn this article we extend our previous work on the continuous single‐module design problem to the multiple‐module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch‐and‐bound, partial enumeration, and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.
A Lanchester‐type aggregated‐force model of conventional ground combat
Authors: Taylor James G. 
Published: May 2007

AbstractThis article develops a Lanchester‐type model of large‐scale conventional ground combat between two opposing forces in a “sector”. It is shown that nonlinear Helmbold‐type equations of warfare with operational losses may be used to represent the loss‐rate curves that have been used in many aggregated‐force models. These nonlinear differential equations are used to model the attrition of combat capability (as quantified by a so‐called firepower index) in conjunction with a rate‐of‐advance equation that relates motion of the contact zone (or FEBA) between the opposing forces to the force ratio and tactical decisions of the combatants. This simplified auxiliary model is then used to develop some important insights into the dynamics of FEBA movement used in large‐scale aggregated‐force models. Different types of behavior for FEBA movement over time are shown to correspond to different ranges of values for the initial force ratio, for example, an attack will “stall out” for a range of initial force ratios above a specific threshold value, but it will “break out” for force ratios above a second specific threshold value. Such FEBA‐movement predictions are essentially based on being able to forecast changes over time in the force ratio.
Approximate Bayesian intervals for the reliability of series systems from mixed subsystem test data
Authors: Lampkin Harold , Winterbottom Alan 
Published: May 2007

AbstractThe determination of exact Bayesian intervals for the reliability of a series system from subsystem test data gives rise to computational difficulties involving severe loss of computing precision as the number of subsystems in the system increases. The end points of Bayesian intervals are percentage points of the posterior distribution and these are shown to be well approximated by Cornish and Fisher expansions when the number of subsystems is small. As the number of subsystems in the system increases even greater accuracy is guaranteed by the asymptotic nature of the expansions. The system posterior distribution function is also shown to be well approximated by an Edgeworth expansion.
Characterizations of the exponential distribution by higher‐order gap
Authors: Ahsanullah M. 
Published: May 2007

AbstractSuppose X1,X2, ⃛,Xn is a random sample of size n from a continuous distribution function F(x) and let X1,n, ≦ X2,n ≦ ⃛ ≦ Xn,n be the corresponding order statistics. We define the jth‐order gap gi,j as gi,j = Xi+j,n − Xi,n, 1 ≦ i < n, 1 ≦ j ≦ n − i. In this article characterizations of the exponential distribution are given by considering the distributional properties of gk,n‐k, 1 ≦ k ≦ n.
Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
Authors: Tufekci Suleyman 
Published: May 2007

AbstractDecomposition algorithms for finding a shortest path between a source node and a sink node of an arbitrary distance network are developed. Different decomposition algorithms are proposed for different network topologies. Since Shier's algorithm compares very favorably with other decomposition algorithms in all the network topologies, we compare our algorithms against Shier's algorithm. It is shown that the efficiency of the proposed algorithms compares very favorably with Shier's algorithm. For special types of networks the computational requirements of the proposed algorithm is a polynomial of O(n2).
Another inventory model with a mixture of backorders and lost sales
Authors: Park Kyung S. 
Published: May 2007

AbstractThis article presents another inventory model for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 − b is lost. By defining a time‐proportional backorder cost and a fixed penalty cost per unit lost, a unimodal objective function representing the average annual cost of operating the inventory system is obtained. The optimal operating policy variables are calculated directly.
Finite‐production‐rate inventory models with first‐and second‐shift setups
Authors: Chand Suresh , Sethi Suresh 
Published: May 2007

AbstractThis article considers the production planning problem of a shop which can produce in either one shift or two shifts. Setup cost is charged whenever there is an increase in the production rate from one period to the next. Efficient planning horizon procedures have been developed for this model. A numerical example has been included to illustrate the planning horizon results.
On preservation of classes of life distributions under reliability operations: Some complementary results
Authors: Bondesson Lennart 
Published: May 2007

AbstractA counterexample of general character is constructed showing that the NWUE class is not preserved under mixing. Some general classes of life distributions are introduced and their behavior under mixing and convolution is studied. These classes have a theoretical character but coincide in many cases with well‐known classes. It is proved that the DMRL class is not preserved under convolution.
A closed‐from approach for multi‐item inventory grouping
Authors: Aggarwal Vijay 
Published: May 2007

AbstractThe problem of optimally coordinating the replenishments of the many items in stock with one another is dealt with in this article. Specifically, it considers this coordination based on classifying the items into a few groups with common order cycles for all the items in a particular group. Assuming that the cumulative distribution by value of the inventory can be characterized by a Pareto function of the type f(n) = n/(an + b), (a, b > 0), it establishes that the optimal boundaries of the groups can be obtained as closed‐form expressions by solving a system of simultaneous equations. The composition of the successive groups thus obtained is found to equipartition the total cost and to follow geometric sequences in relation to the number of items, the value of items, and the lengths of the order cycles. Graphs have been proposed to aid the implementation of the grouping scheme. Simple iterative schemes are outlined within the framework of the Pareto function to handle other relevant costs.
A note on a prediction interval for a first‐order Gauss Markov process
Authors: Jayachandran Toke 
Published: May 2007

AbstractLet Xt, t = 1,2, ⃛, be a stationary Gaussian Markov process with E(Xt) = μ and Cov(Xt, Xt+k) = σ2ρk. We derive a prediction interval for X2n+1 based on the preceding 2n observations X1,X2, ⃛,X2n.
Extrapolation of the mean lifetime of a large population from its preliminary survival history
Authors: Keilson J. , Sumita U. 
Published: May 2007

AbstractA large population of independent identical units having finite mean lifetime T is observed. From the history A(y) of cumulative arrivals and the history B(y) of cumulative removals in the interval 0 ≦ y ≦ τ one must predict at time τ the desired T. Two lifetime predictors X(τ) and Y(τ) and related simple predictors obtained from A(y) and B(y) are shown to converge to T with a rate of convergence dependent on the structure of the failure rate function of the units. This dependence is studied theoretically and numerically.