bluuebunny/crossref_metadata_2025_split huggingface dataset:
A class of inventory models with customer impatience
Authors: Posner M. J. M. , Yansouni B. 
Published: May 2007

AbstractClassical inventory models generally assume either no backlogging of demands or unlimited backlogging. This paper treats the case wherein backlogged customers are willing to wait for a random period of time for service. A broad class of such models is discussed, with a more complete analysis performed on a simple subclass. Steady state equations are derived and solved assuming exponentially distributed interarrival times of customers, order delivery lead times, and customer patience.
Systems approach to the multistage manufacturing connected‐unit situation
Authors: Ercan Sedat Sami 
Published: May 2007

AbstractThis paper investigates the relationships among incoming quality limit (AIQL), manufacturing quality level in each stage of production, and outgoing quality limit (AOQL), for a multistage manufacturing connected‐unit situation from the systems cost‐effectiveness point of view. An objective function is developed and the formulated problem is solved using discrete optimization technique.The study is restricted to the development of single sampling plans where inspection is by attribute. Lot size and sample size are fixed for incoming and outgoing inspection for each stage of manufacturing.
On the economic application of airlift to product distribution and its impact on inventory levels
Authors: Gross Donald , Soriano A. 
Published: May 2007

AbstractIn many resupply situations, the decisionmaker has the option of “purchasing” faster replenishment leadtimes. For example, a premium may be paid for delivery by parcel post rather than slower but less expensive delivery by railway express. It may be economically advantageous to pay shipment premiums for faster leadtimes when considering the possible cost reductions in pipeline (on‐order) inventory and safety stock levels. This paper develops a decision rule which, for any given item, will indicate whether it is economically advantageous to purchase a faster leadtime. The general methodology is then applied to a peacetime military resupply operation involving several million items, each requiring a decision as to whether the item should be shipped by air or sea.
Duality in fractional programming
Authors: Kydland Finn 
Published: May 2007

AbstractThis paper develops theoretical and computational aspects of the dual problem in linear fractional programming. This is done on the basis of two alternative methods for solving the primal fractional programming problem, both of which were presented in earlier literature. Parametric changes in the resource‐vector are considered, and attention is given to infinitesimal as well as to discrete changes.
A probabilistic evaluation of helicopter lift capability
Authors: Limaye Dilip R. , Levy Edwin 
Published: May 2007

AbstractThis paper describes a technique for the calculation of the probability that a helicopter can lift a specified load, or number of loads with a specified frequency distribution, in a given geographical region. This probability is computed by determining the bivariate altitude‐temperature probability distribution for the specified region. The payload capability at any given temperature and altitude is calculated from standard performance equations. By integrating this over the altitude‐temperature distribution, it is possible to obtain the probability distribution of payload capability, from which the required probabilities of lifting specific loads can be determined.
On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
Authors: Bratley Paul , Florian Michael , Robillard Pierre 
Published: May 2007

AbstractRecent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/Fmax) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness.
Inventory models with a mixture of backorders and lost sales
Authors: Montgomery Douglas C. , Bazaraa M. S. , Keswani Ajit K. 
Published: May 2007

AbstractThis article presents several single‐echelon, single‐item, static demand inventory models for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 ‐ b is lost forever. Both deterministic and stochastic demand are considered. although the case of stochastic demand is treated heuristically. In each situation, a mathematical model representing the average annual cost of operating the inventory system is developed. and an optimum operating policy derived. At the extremes b=1 and b=0 the models presented reduce to the usual backorders and lost sales cases, respectively.
Bounds on the availability function
Authors: Butterworth Richard W. , Nikolaisen Tor 
Published: May 2007

AbstractThis paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given.
A continuous submarine versus submarine game
Authors: Langford Eric 
Published: May 2007

AbstractThis paper analyzes, from a game‐theoretic standpoint, the simultaneous choice of speeds by a transitor and by an SSK which patrols back and forth perpendicular to the transitor's course. Using idealized acoustic assumptions and a cookie‐cutter detection model which ignores counterdetection, we are able to present the problem as a continuous game, and to determine an analytic solution. The results indicate that with these assumptions, there are conditions under which neither a “go fast” nor a “go slow” strategy is optimal. The game provides a good example of a continuous game with a nontrivial solution which can be solved effectively.
Total optimality of incrementally optimal allocations
Authors: Stone Lawrence D. 
Published: May 2007

AbstractThis paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n‐space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be usedSuppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion.
An explicit general solution in linear fractional programming
Authors: Charnes A. , Cooper W. W. 
Published: May 2007

AbstractA complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the Farkas‐Minkowki lemma and the duality relationships which emerge from the Charnes‐Cooper linear programming equivalent for general linear fractional programming. The formulations as well as the proofs and the transformations provided by our general linear fractional programming theory are here employed to provide a substantial simplification for this class of cases. The augmentation developing the explicit solution is presented, for clarity, in an algorithmic format.
Estimation of a hidden service distribution of an M/G/∞ system
Authors: George Laurence Lee , Agrawal Avinaeh C. 
Published: May 2007

AbstractThe maximum likelihood estimator of the service distribution function of an M/G/∞ service system is obtained based on output time observations. This estimator is useful when observation of the service time of each customer could introduce bias or may be impossible. The maximum likelihood estimator is compared to the estimator proposed by Mark Brown, [2]. Relative to each other, Brown's estimator is useful in light traffic while the maximum likelihood estimator is applicble in heavy trafic. Both estimators are compared to the empirical distribution function based on a sample of service times and are found to have drawbacks although each estimator may have applications in special circumstances.
Decision rules for attacking targets of opportunity
Authors: Mastran David V. , Thomas Clayton J. 
Published: May 2007

AbstractFrequently in warfare, a force is required to attack a perishable enemy target system ‐ a target system where the targets are detected seemingly at random, and if not immediately attacked, will shortly escape from detection. A conflicting situation arises when an attack element detects a target of relatively low value and has to decide whether to expend his resources on that particular target or to wait for a more lucrative one, hoping one will be found. This paper provides a decision rule giving the least valued target that should be attacked as well as the resources that should be expended as a function of the attack element's remaining mission time.
Optimal and suboptimal procedures in group sequential sampling
Authors: Spahn M. , Ehrenfeld S. 
Published: May 2007

AbstractThis paper investigates the problem of choosing between two simple hypothesis, H0 and H1, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule.It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures.
A generalized euclidean procedure for integer linear programs
Authors: Richmond Tyronza R. , Ravindran Arunachalam 
Published: May 2007

AbstractThis paper investigates a new procedure for solving the general‐variable pure integer linear programming problem. A simple transformation converts the problem to one of constructing nonnegative integer solutions to a system of linear diophantine equations. Rubin's sequential algorithm, an extension of the classic Euclidean algorithm, is used to find an integer solution to this system of equations. Two new theorems are proved on the properties of integer solutions to linear systems. This permits a modified Fourier‐Motzkin elimination method to be used to construct a nonnegative integer solution. An experimental computer code was developed for the algorithm to solve some test problems selected from the literature. The computational results, though limited, are encouraging when compared with the Gomory all‐integer algorithm.
The development and evaluation of a cost‐based composite scheduling rule
Authors: Aggarwal Sumer C. , McCarl Bruce A. 
Published: May 2007

AbstractA cost‐based composite scheduling rule is developed and evaluated in comparison with three other well‐researched scheduling rules—SPT, S/OPN, and SST. This cost rule permits the optimization of more than one performance measure at a time. The priority number that is used for scheduling operations through each machine group is based on four separate performance measures—(1) In‐process Inventory, (2) Facilities Utilization, (3) Lateness, and (4) Mean Setup Time. The factorial experimental design involved three factor levels of loads, three factor levels of cost, and three factor levels of mean time. Analysis of variance was performed on each of the five output measures to study the effects of each of the three factors on each individual rule. Rank‐order comparisons between rules were also made; and, finally, general conclusions with regard to the effectiveness and flexibility of the Cost Rule were drawn.
A generalized recursive algorithm for a class of non‐stationary regeneration (scheduling) problems
Authors: Glover Fred , Klastorin Theodore D. 
Published: May 2007

AbstractRecent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows.This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques.
Optimization in mixed‐integer space with a single linear bound
Authors: Lambe Thomas A. 
Published: May 2007

AbstractThe search for an optimal point in a mixed‐integer space with a single linear bound may be significantly reduced by a procedure resembling the Lagrangian technique. This procedure uses the coefficients of the linear bound to generate a set of necessary conditions that may eliminate most of the space from further consideration. Enumerative or other techniques can then locate the optimum with greater efficiency. Several methods are presented for applying this theory to separable and quadratic objectives. In the maximization of a separable concave function, the resulting average range of the variables is approximately equal to the maximum (integer) coefficient of the constraint equation.
The economic effects of inspector error on attribute sampling plans
Authors: Bennett G. Kemble , Case Kenneth E. , Schmidt J. W. 
Published: May 2007

AbstractIn this paper the effects of inspector error on a cost‐based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error‐free and error‐prone inspection procedures and some comparisons are made.
Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
Authors: Corwin Burton D. , Esogbue Augustine O. 
Published: May 2007

AbstractThis paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed.
Large deviations of the winsorized mean of an exponential distribution
Authors: Book Stephen A. 
Published: May 2007

AbstractAn asymptotic representation for large deviation probabilities of the Winsorized mean of a sequence of independent, identically distributed exponential random variables is derived. The Winsorized mean, a linear combination of exponential order statistics, is first transformed into a weighted sum of exponential random variables, and then a large deviation theorem for weighted sums can be applied. The representation obtained is then compared with results already known for the mean and the median, the two extreme cases of the Winsorized mean.
Target selection in lanchester combat: Heterogeneous forces and time‐dependent attrition‐rate coefficients
Authors: Taylor James G. 
Published: May 2007

AbstractWe develop solutions to two fire distribution problems for a homogeneous force in Lanchester combat against heterogeneous enemy forces. The combat continues over a period of time with a choice of tactics available to the homogeneous force and subject to change with time. In these idealized combat situations the lethality of each force's fire (as expressed by the Lanchester attrition‐rate coefficient) depends upon time. Optimal fire distribution rules are developed through the combination of Lanchester‐type equations for combat attrition and deterministic optimal control theory (Pontryagin maximum principle). Additionally, the theory of state variable inequality constraints is used to treat the nonnegativity of force levels. The synthesis of optimal fire distribution policies was facilitated by exploiting special mathematical structures in these problems.
Optimal replacement under additive damage and other failure models
Authors: Taylor Howard M. 
Published: May 2007

AbstractA machine or production system is subject to random failure. Upon failure the system is replaced by a new one, and the process repeats. A cost is associated with each replacement, and an additional cost is incurred at each failure in service. Thus, there is an incentive for a controller to attempt to replace before failure occurs. The problem is to find an optimal control strategy that balances the cost of replacement with the cost of failure and results in a minimum total long‐run average cost per unit time. We attack this problem under the cumulative damage model for system failure. In this failure model, shocks occur to the system in accordance with a Poisson process. Each shock causes a random amount of damage or wear and these damages accumulate additively. At any given shock, the system fails with a known probability that depends on the total damage accumulated to date. We assume that the cumulative damage is observable by the controller and that his decisions may be based on its current value. Supposing that the shock failure probability is an increasing function of the cumulative damage, we show that an optimal policy is to replace either upon failure or when this damage first exceeds a critical control level, and we give an equation which implicitly defines the optimal control level in terms of the cost and other system parameters. Also treated are some more general models that allow for income lost during repair time and other extensions.
An operator theory of parametric programming for the generalized transportation problem: I. Basic theory
Authors: Balachandran V. , Thompson G. L. 
Published: May 2007

AbstractThis paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph‐theoretic approach is utilized to define the basis as a one‐forest consisting of one‐trees (a tree with an extra edge). Algorithmic development of the pivot‐step is presented by the representation of a two‐tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper.
The knapsack problem: A survey
Authors: Salkin Harvey M. , De Kluyver Cornelis A. 
Published: May 2007

AbstractA unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to	\documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ⩾ 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi‐dimensional case, are also considered.
Sensitivity of the (Q, R) inventory model to penalty cost parameter
Authors: Das Chandrasekhar 
Published: May 2007

AbstractThis paper treats an approximate continuous review inventory model with backlogging of excess demand and stochastic leadtime. The major result derived is that the behavior of the optimal order size with respect to the shortage cost parameter is determined solely by the “conditional mean residual life” function corresponding to the leadtime demand distribution. Some minor results and illustrative examples are also included.
A mean cost approximation for transportation problems with stochastic demand
Authors: Wilson Dan 
Published: May 2007

AbstractAmong the many tools of the operations researcher is the transportation algorithm which has been used to solve a variety of problems ranging from shipping plans to plant location. An important variation of the basic transportation problem is the transportation problem with stochastic demand or stochastic supply. This paper presents a simple approximation technique which may be used as a starting solution for algorithms that determine exact solutions. The paper indicates that the approximation technique offered here is superior to a starting solution obtained by substituting expected demand for the random variables.
Sensitivity of queueing models to the assumption of exponentiality
Authors: Gross Donald 
Published: May 2007

AbstractThis study deals with determining the effects on queuing models of assuming that interarrival and service times are exponentially distributed. Steady‐state expected value measures of congestion are compared for a variety of GI/G models when assuming an M/M model as an approximation. The majority of this effort involves single‐channel queues; however, some multichannel situations are also considered. In addition, effects of the exponential approximation are observed in certain cost‐optimization models.
Instant transportation solutions
Authors: Szwarc Wlodzimierz 
Published: May 2007

AbstractThis paper presents direct noniterative methods for solving such known problems as shoploading and aggregate scheduling. There is given a simple optimal rule for the shop‐loading problem which is quite surprising. The crucial point in solving this problem is what not to assign rather than what to assign. The development of those methods was possible since the discussed problems can be converted into a special transportation model where the given cost coefficients cij assume a form cij = ui + uj.