bluuebunny/crossref_metadata_2025_split huggingface dataset:
Project scheduling: The effects of problem structure on heuristic performance
Authors: Patterson James H. 
Published: May 2007

AbstractIndividual characteristics of multiple‐constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution.
A class of distributions generated from distributions of exponential type
Authors: Elandt‐Johnson Regina C. 
Published: May 2007

AbstractA class of exponential type distributions with special exponential parameters is defined. It is assumed that the exponential parameters vary according to some (known) probability law. It has been shown in this paper that the compound distribution can be easily represented in form involving moment generating function of the mixing distribution. The results obtained in this paper provide an efficient and simple method of obtaining compound failure time distribution with known mixing distributions (uniform, exponential, gamma).
A markov chain version of the secretary problem
Authors: Albright S. Christian 
Published: May 2007

AbstractThis paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained.
Transportation type problems with quantity discounts
Authors: Balachandran V. , Perry Avinoam 
Published: May 2007

AbstractIt is known to be real that the per unit transportation cost from a specific supply source to a given demand sink is dependent on the quantity shipped, so that there exist finite intervals for quantities where price breaks are offered to customers. Thus, such a quantity discount results in a nonconvex, piecewise linear functional. In this paper, an algorithm is provided to solve this problem. This algorithm, with minor modifications, is shown to encompass the “incremental” quantity discount and the “fixed charge” transportation problems as well. It is based upon a branch‐and‐bound solution procedure. The branches lead to ordinary transportation problems, the results of which are obtained by utilizing the “cost operator” for one branch and “rim operator” for another branch. Suitable illustrations and extensions are also provided.
Longitudinal manpower planning models
Authors: Grinold Richard C. , Marshall Kneale T. , Oliver Robert M. 
Published: May 2007

AbstractA manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases.
On the assignment and sequencing of operations on a crew‐served project
Authors: Bulfin R. L. , Parker R. G. 
Published: May 2007

AbstractThis paper is concerned with assigning and sequencing a set of activities for some or all members of a crew of operators so that the completion time of all such operations is minimized. It is assumed that each of the operators in the crew possesses, initially, certain tasks that only he can perform. A branch‐and‐bound scheme is proposed to treat the problem, and suitable computational experience is provided.
A measure of effectiveness for sensors and strategies
Authors: Antoniak Charles E. 
Published: May 2007

AbstractThis paper discusses a possible measure of effectiveness for information sensing equipment, such as radar or sonar, based on its ability to provide information. It is shown that such a measure is particularly appropriate for situations where a sequence of similar limited engagements may occur, as on antisubmarine patrol, for example. In this case the measure expresses the expected rate of gain per engagement of the relative resources of the participants. Rates are calculated for the optimal and certain simpler, but suboptimal, strategies. The measure is illustrated by an exact analysis of a gambling problem and a qualitative treatment of an anti‐missile missile allocation problem.
On nash subsets and mobility chains in bimatrix games
Authors: Heuer G. A. , Millham C. B. 
Published: May 2007

AbstractThis work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved.
On the core and competitive equilibria of a market with indivisible goods
Authors: Kaneko Mamoru 
Published: May 2007

AbstractWe consider a generalization of the assignment game of Shapley and Shubik [4]. In the market which we consider, s kinds of indivisible goods are exchanged for money. The market consists of buyers and sellers. Each buyer wants to buy at most one unit of the goods, and each seller may sell more than one unit. First, we show that the set of all competitive imputations is given by the solutions of a certain linear programing problem dual to the optimal problem. Second, we show that the core of the market coincides with the set of all competitive imputations under some condition, and consider the core of the market where s=1 and the condition does not hold.
On the relationship between the force ratio and the instantaneous casualty‐exchange ratio for some lanchester‐type models of warfare
Authors: Taylor James G. 
Published: May 2007

AbstractA “local” condition of winning (in the sense that the force ratio is changing to the advantage of one of the combatants) is shown to apply to all deterministic Lanchester‐type models with two force‐level variables. This condition involves the comparison of only the force ratio and the instantaneous force‐change ratio. For no replacements and withdrawals, a combatant is winning “instantaneously” when the force ratio exceeds the differential casualty‐exchange ratio. General outcome‐prediction relations are developed from this “local” condition and applied to a nonlinear model for Helmbold‐type combat between two homogeneous forces with superimposed effects of supporting fires not subject to attrition. Conditions under which the effects of the supporting fires “cancel out” are given.
AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM
Authors: Neebe A. W. , Rao M. R. 
Published: May 2007

AbstractThe segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set‐packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.
Determining adjacent vertices on assignment polytopes
Authors: McKeown Patrick G. 
Published: May 2007

AbstractTo rank the solutions to the assignment problem using an extreme point method, it is necessary to be able to find all extreme points which are adjacent to a given extreme solution. Recent work has shown a procedure for determining adjacent vertices on transportation polytopes using a modification of the Chernikova Algorithm. We present here a procedure for assignment polytopes which is a simplification of the more general procedure for transportation polytopes and which also allows for implicit enumeration of adjacent vertices.
Suboptimal decision rule for attacking targets of opportunity
Authors: Kisi Takasi 
Published: May 2007

AbstractA player having only a definite number of weapons is hunting targets. His total hunting time is also limited. Targets of opportunity with various values arrive at random, and as soon as a target arrives the player observes the target value and decides whether or not to shoot it down. The issue is what the decision rule is which guarantees him a maximum expected gain during the hunting time. Poisson arrival of the targets, uniform distribution of the target value, and the shoot‐look‐shoot scheme qre assumed. A decision rule is derived which is not optimal but has a very simple form and gives almost as good value as the optimal decision rule does.
Armor configurations via dynamic programming
Authors: Shear R. E. , Arbuckle A. L. , Kucher V. B. 
Published: May 2007

AbstractThe problem of selecting materials, their thicknesses and order for armor designed for the defeat of shaped charge threats, has been formulated as a constrained optimization problem. The mathematical model provides an optimal order and thickness of each layer of material such that the resulting armor configuration will be of minimum mass per unit area subject to constraints on total thickness and shaped charge jet tip exit velocity.
The conjugate gradient technique for certain quadratic network problems
Authors: Leblanc Larry J. 
Published: May 2007

AbstractWe consider a class of network flow problems with pure quadratic costs and demonstrate that the conjugate gradient technique is highly effective for large‐scale versions. It is shown that finding a saddle point for the Lagrangian of an m constraint, n variable network problem requires only the solution of an unconstrained quadratic programming problem with only m variables. It is demonstrated that the number of iterations for the conjugate gradient algorithm is substantially smaller than the number of variables or constraints in the (primal) network problem. Forty quadratic minimum‐cost flow problems of various sizes up to 100 nodes are solved. Solution time for the largest problems (4,950 variables and 99 linear constraints) averaged 4 seconds on the CBC Cyber 70 Model 72 computer.
Solving quadratic assignment problems with rectangular distances and integer programming
Authors: Love Robert F. , Wong Jsun Y. 
Published: May 2007

AbstractThe problem considered involves the assignment of n facilities to n specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs.Assume these n locations are given as points on a two‐dimensional plane and transportation costs are proportional to weighted rectangular distances. Then the problem is formulated as a binary mixed integer program. The number of integer variables (all binary) involved equals the number of facilities squared. Without increasing the number of integer variables, the formulation is extended to include “site costs” Computational results of the formulation are presented.
State‐dependent gap acceptance
Authors: Harris Carl M. 
Published: May 2007

AbstractThis paper considers a traffic problem in which vehicles queue up according to a Poisson process on a single‐lane entrance ramp prior to merging into a major stream of vehicular traffic. In order to then prevent the ramp queue from becoming too large, a model is proposed which considers a lowering of the critical gap as the ramp queue size increases. With the critical gap assumed to be a nonincreasing function of the number of vehicles on the ramp at instances that correspond to departure times of lead vehicles from the ramp queue, the resultant model is an M/G/1 queue with state‐dependent service times. Some general results are obtained for this model and a specific case discussed in moderate detail.
Confidence bounds and propagation of uncertainties in system availability and reliability computations
Authors: Shaw L. , Shooman M. L. 
Published: May 2007

AbstractThis paper develops bounds on the uncertainties in system availabilities or reliabilities which have been computed from structural (series, parallel, etc.) relations among uncertain subsystem availabilities or reliabilities. It is assumed that the highly available (reliable) subsystems have been tested or simulated to determine their unavailabilities (unreliabilities) to within some small percentages of uncertainty. It is shown that series, parallel and r out of n structures which are nominally highly available will have unavailability uncertainties whose percentages errors are of the same order as the subsystem uncertainties. Thus overall system analysis errors, even for large systems, are of the same order of magnitude as the uncertainties in the component probabilities. Both systematic (bias type) uncertainties and independent random uncertainties are considered.
A semieconomic method for the determination of optimal lot sizes
Authors: Massa Larry 
Published: May 2007

AbstractThe construction of lot sizes usually depends upon factors influencing homogeneity. When these factors are not a function of lot quantity, it is possible to determine an optimal lot size. The optimization process balances the cost of sampling against the expected cost of lot rejection for some specified procurement quantity. The rationale for balancing the two costs is contingent upon the fact that rejection criteria waivers frequently occur when the lot size is large. This concept implies that the lot size should be as small as possible, whereas the cost of sampling drives the lot size up. Hence, trade‐offs may be made. The formulation is termed a semieconomic one because it combines a pure economic objective function with a pure statistical constraint. This constraint is necessary because the nature of the items under study dictates that the cost of accepting defective material cannot be explicitly stated. The paper presents the formulation, describes when it should be used, derives a good analytical approximation under certain assumptions and gives various ramifications when it is used.
Optimal reject allowance with constant marginal production efficiency
Authors: Beja Avraham 
Published: May 2007

AbstractA job shop must fulfill an order for N good items. Production is conducted in “lots,” and the number of good items in a lot can be accurately determined only after production of that lot is completed. If the number of good items falls short of the outstanding order, the shop must produce further lots, as necessary.Processes with “constant marginal production efficiency” are investigated. The revealed structure allows efficient exact computation of optimal policy. The resulting minimal cost exhibits a consistent (but not universal) pattern whereby higher quality of production is advantageous even at proportionately higher marginal cost.
A chance‐constrained distribution problem
Authors: Reese Richard M. , Stedry Andrew C. 
Published: May 2007

AbstractThe transportation model with supplies (Si) and demands (Di) treated as bounded variables developed by Charnes and Klingman is extended to the case where the Si and Di are independently and uniformly distributed random variables. Chance constraints which require that demand at the jth destination will be satisfied with probability at least βi and that stockout at the ith origin will occur with probability less than αi are imposed. Conversion of the chance constraints to their linear equivalents results in a transportation problem with one more row and column than the original with some of the new arcs capacitated. The chance‐constrained formulation is extended to the transshipment problem.
Johnson's approximate method for the 3 × n job shop problem
Authors: Szwarc Wlodzimierz , Hutchinson George K. 
Published: May 2007

AbstractThe effectiveness of Johnson's Approximate Method (JAM) for the 3 × n job shop scheduling problems was examined on 1,500 test cases with n ranging from 6 to 50 and with the processing times Ai, Bi, Ci (for item i on machines A, B, C) being uniformly and normally distributed. JAM proved to be quite effective for the case Bi ⩽ max (Ai, Ci) and optimal for Bi, ⩽ min (Ai, Ci).
Optimal dynamic rules for assigning customers to servers in a heterogeneous queuing system
Authors: Winston Wayne 
Published: May 2007

AbstractWe consider a queuing system in which both customers and servers may be of several types. The distribution of a customer's service time is assumed to depend on both the customer's type and the type of server to which he is assigned. For a model with two servers and two customer types, conditions are presented which ensure that the discounted number of service completions is maximized by assigning customers with longer service times to faster servers. Generalizations to more complex models are discussed.
Computing bounds for the optimal value in linear programming
Authors: Kallio Markku 
Published: May 2007

AbstractConsider a standard linear programming problem and suppose that there are bounds available for the decision variables such that those bounds are not violated at an optimal solution of the problem (but they may be violated at some other feasible solutions of the problem). Thus, these bounds may not appear explicitly in the problem, but rather they may have been derived from some prior knowledge about an optimal solution or from the explicit constraints of the problem.In this paper, the bounds on variables are used to compute bounds on the optimal value when the problem is being solved by the simplex method. The latter bounds may then be used as a termination criteria for the simples iterations for the purpose of finding a “sufficiently good” near optimal solution. The bounds proposed are such that the computational effort in evaluating them is insignificant compared to that involved in the simplex iterations. A numerical example is given to demonstrate their performance.
Optimal disposal policies for a single‐item inventory system with returns
Authors: Heyman Daniel P. 
Published: May 2007

AbstractWe consider a single‐item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy.It is shown that this problem is equivalent to a problem of controlling a single‐server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given.An interesting by‐product of our investigation is an approximation for the steady‐state behavior of the bulk GI/G/1 queue with a queue limit.
Probability density function of a stochastic linear programming problem
Authors: Hsia Wei Shen 
Published: May 2007

AbstractA stochastic linear programming problem under the “wait‐and‐see” situation is studied. After the conditions for the interchange of the order of integration and differentiation are surveyed, an explicit form of the probability density function of the stochastic linear programming problem is found. An example is also given to illustrate the result.
Probabilistic priorities in the M/G/1 queue
Authors: Matthews D. E. 
Published: May 2007

AbstractA simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed.
Characterization of the nucleolus for a class of n‐person games
Authors: Owen Guillermo 
Published: May 2007

AbstractAn inductive procedure is given for finding the nucleolus of an n‐person game in which all coalitions with less than n‐1 players are totally defeated. It is shown that, for such a game, one of three things may occur: (a) all players receive the same amount; (b) each player receives his quota, plus a certain constant (which may be positive, nerative, or zero); (c) the weakest player receives one half his quota, and the other players divide the remaining profit according to the nucleolus of a similar (n‐1)‐person game. It is also shown that the nucleolus of such a game yields directly the nucleolus of each derived game. An example is worked out in detail.
A note on the relationship between correlation and circular error probability (CEP)
Authors: Olsen Dale E. 
Published: May 2007

AbstractThis note investigates the effects of ignoring correlation (p) as is sometimes done when estimating or placing confidence intervals on circular error probability (CEP). It is shown that better estimates of CEP can be made if the axis is rotated [5] so that the estimate of p is zero. It is also shown that ignoring variability in estimating correlation can affect the confidence intervals on CEP or the placing of a lower bound on the probability content of a circle.
Replacement models under additive damage
Authors: Zuckerman Dror 
Published: May 2007

AbstractA production system which generates income is subject to random failure. Upon failure, the system is replaced by a new identical one and the replacement cycles are repeated indefinitely. In our breakdown model, shocks occur to the system in a Poisson stream. Each shock causes a random amount of damage, and these damages accumulate additively. The failure time depends on the accumulated damage in the system. The income from the system and the cost associated with a planned replacement depend on the accumulated damage in the system. An additional cost is incurred at each failure in service. We allow a controller to replace the system at any stopping time T before failure time. We will consider the problem of specifying a replacement rule that is optimal under the following criteria: maximum total long‐run average net income per unit time, and maximum total long‐run expected discounted net income. Our primary goal is to introduce conditions under which an optimal policy is a control limit policy and to investigate how the optimal policy can be obtained. Examples will be presented to illustrate computational procedures.
A bayesian approach to evaluating military investments in product improvement and testing
Authors: Robinson R. T. 
Published: May 2007

AbstractTwo issues of frequent importance in new product development are product improvement and reliability testing. A question often faced by the developer is: Should the product be distributed in its present state, or should it be improved further and/or tested before distribution? A more useful statement of the question might be: What levels of investment in further improvement and testing are economically permissible? Products for which this question is relevant may vary widely in type and intended use. This paper presents a model for determining these levels for one such product—an equipment modification procedure. The model presented makes use of present value analysis to compare cost streams and of Bayesian statistics to relate the costs to various outcomes under conditions of uncertainty. The model is applied to an actual military problem and a method is described for examining the sensitivity of the results to changes in the prior probabilities and discount rate.