bluuebunny/crossref_metadata_2025_split huggingface dataset:
Simulation and the logistics systems laboratory
Authors: Geisler M. A. , Haythorn W. W. , Steger W. A. 
Published: May 2007

AbstractSystems analysis is the term used to describe the study of large and complex systems. An example would be the problem involved in the employment and support of new weapon systems and the selection among alternative weapon systems for achieving given strategic or tactical objectives. Several techniques have been used in systems analysis, ranging in degree of abstraction from collection and statistical analysis of data gathered in field tests to highly abstract mathematical models and analysis.An intermediate approach in this spectrum of abstraction is called simulation. Its use has been bettered significantly by the availability of electronic computers, which permit the specification of the environment in sufficient detail to obtain good correspondence between the characteristics of the simulated system and the system under study, and by the rapid calculation of the simulated system to study its characteristics.Simulation itself consists of a variety of alternative and complementary techniques for simulating systems. One such method is “game‐simulation” — the principal topic of this paper. The joint and integrated use of people and computers to simulate complex man‐machine systems characterizes game‐simulation. This paper compares game‐simulation with other simulation techniques; describes its use inlogistics research; explains the results obtained in analyzing logistics systems; and gives the advantages and disadvantages of the technique at its present state of development.
Optimum allocation of a spares budget
Authors: Blitz M. , Wnltham  
Published: May 2007

AbstractAn algorithm is derived for allocating finite resources in discrete amounts to a number of activities subject to a set of nonlinear constraints. The algorithm differs from those previously described in that the amount of the resource consumed for an additional unit of any one activity need not be constant. The algorithm is then applied to the problem of allocating a spares budget when repair of failed subsystems is allowed and the cost of unit subsystems is a function of the number to be spared. Two models are presented: one with an unrestricted repair facility, exponential failure distributions, and general repair distributions; and another with more limited repair and exponential failure and repair distributions.
Scheduling general production systems using schedule algebra
Authors: Ciffler B. 
Published: May 2007

AbstractThe objective of this work is to demonstrate the use of schedule algebra to define and solve problems to generate and evaluate production schedules and, in the process, to describe a recently completed computer program, SCHEDULER I, which solves this problem for a wide class of products and production systems. The problem formulation requires that the program user describe each system output in terms of its constituent tasks and state, for each task, all restraints which will or may affect either the time it is performed or the choice of a particular facility to perform it. The user must also specify the numbers and types of facilities which are available to perform the tasks and all restraints affecting these availabilities. The problem is, given restraints of the preceding character, to determine when each task starts and ends, the specific facility which performs it, how long the task had to wait for the facility to become available (or, if the facility was previously idle, how long it was idle) and how long the task's scheduled start could be postponed without automatically forcing the postponement of the scheduled start of any other task. Novel features of the problem formulation permit the user to specify, with considerable latitude, the decision rules to be used in selecting tasks to be started on a vacated facility, to freely dovetail successive tasks to produce a same output and successive tasks performed by a same facility, and to change the capacity of the production system at any point in time. The program automatically readjusts the time‐phasing of a task if its processing must be interrupted in order to reduce the capacity of the production system.
N‐person games in partition function form
Authors: Thrall R. M. , Lucas W. F. 
Published: May 2007

AbstractThis paper gives a formulation of a theory of n‐person cooperative games with side payments in terms of a partition function which is defined on the set of all partitions of the set of players. The results for all games with n ≤ 3 are presented. This development generalizes the von Neumann‐Morgenstern theory of games in characteristic function form.
Some factors that affect the overhaul cost of ships: An exercise in statistical cost analysis
Authors: Farrar Donald E. , Apple Robert E. 
Published: May 2007

AbstractCross sectional data on 85 U.S. Atlantic Fleet warships is collected and analyzed. Multivariate statistical techniques are employed in an attempt to relate thorough overhaul repair expenditures to factors such as age, size, complexity, power plant, and usage level. Several variables are found to be statistically significant and quantitatively important. Parameter estimates, measures of statistical and predictive importance for individual variables, and examples of the model's use are included.
Analysis of A time‐shared processor
Authors: Kleinrock Leonard 
Published: May 2007

AbstractThis paper analyzes a queueing structure for a time‐shared service facility (or processor) and compares these results with a straightforward first‐come first‐served discipline. The assumption is that the processing time for each job is chosen from a geometric distribution. This time‐shared discipline shares the desirable features of a first‐come first‐served principle, as well as that of a discipline which services short jobs first. It is shown that those jobs with shorter than average processing requirements, spend less time in the queue than they would in a strict first‐come first‐served system, and conversely for longer than average jobs.
Decomposition of linear programs by dynamic programming
Authors: Nemhauser George L. 
Published: May 2007

AbstractThe decomposition principle of Dantzig and Wolfe is a method for breaking large linear programs with a block diagonal structure into a set of smaller subprograms. An alternative decomposition scheme derived from a dynamic programming approach is proposed here. This results in a series of parametric linear subprograms whose recursive solution yields the solution to the original linear program.
On the direct sum and tensor product of matrix games
Authors: Mond Bertram 
Published: May 2007

AbstractA direct sum and tensor product of matrix games and of their equivalent linear programs are defined. The relationship of a “composed” game to the corresponding “composed” linear program is derived. Conditions are obtained for the solution of the direct sum or tensor product game to be determined from the solutions of the component games. Examples are given to show how many actual conflicts can be represented by direct sum or tensor product games.
A delay dependent queue discipline
Authors: Kleinrock L. 
Published: May 2007

AbstractQueue disciplines studied in the past have not given the system designer sufficient freedom with which to alter the relative waiting times of the various priority groups. In this paper, results are derived for a delay dependent priority system in which a unit's priority is increased, from zero, linearly with time in proportion to a rate assigned to the unit's priority group. The utility of this new priority structure is that it provides a number of degrees of freedom with which to manipulate the relative waiting times for each priority group.
Team decision models of an inventory supply organization
Authors: Kriebel Charles H. 
Published: May 2007

AbstractWhen uncertainty is a consideration in the normative analysis of decisions and information within organizations, “best” programs of decision rules depend on the information structure which pertains to the organization. Under different information structures, different decision rule programs are optimal relative to the prevailing criteria of organization performance.Propositions from team decision theory may be employed advantageously to resolve behavioral issues in the formal description of organizational decision processes. In specifying the information structure of an organization within the analysis of team problems it becomes useful to distinguish between components of the data generating process and the information system. An information system can be described completely in terms of (1) the space of states of the world, {Xi} = X; (2) the space of information, {Zk} = Z; and (3) the system likelihood function or conditional probability of each item of information, Zk, given the state, Xi, for each Zk ε Z and Xi ε X. The framework of applied statistical decision theory provides an operational procedure for the normative analysis of alternative decision rule programs and information systems.These considerations are illustrated for a simple logistics organization with operating costs given by a constrained asymmetric linear function of inventory and demand. In particular, both normal and extensive form analyses of the team decision problem are detailed under several logistics information systems.
The kernel of a cooperative game
Authors: Davis Morton , Maschler Michael 
Published: May 2007

AbstractThe kernel of a cooperative n‐person game is defined. It is a subset of the bargaining set 𝔐(i). Its existence and some of its properties are studied. We apply it to the 3‐person games, to the 4‐person constant‐sum games, to the symmetric and n‐quota games and to games in which only the n and the (n‐1)‐person coalitions are allowed to be non‐flat.In order to illustrate its merits and demerits as a predictor of an actual outcome in a real‐life situation, we exhibit an example in which the kernel prediction seems frustrating. The opinions of other authors are quoted in order to throw some light on this interesting example.
Minimum‐cost flows in convex‐cost networks
Authors: Hu T. C. 
Published: May 2007

AbstractAn algorithm is given for solving minimum‐cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max‐Flow Min‐Cut Theorem may all be formulated into minimum‐cost flow problems in convex‐cost networks.
A price leadership method for solving the inspector's non‐constant‐sum game
Authors: Maschler Michael 
Published: May 2007

AbstractAn inspector's game is a non‐constant‐sum two‐person game in which one player has promised to perform a certain duty and the other player is allowed to inspect and verify occasionally that the duty has indeed been performed.A solution to a variant of such a game is given in this paper, based on the assumption that the inspector can announce his mixed strategy in advance, if he so wishes, whereas the other player, who has already given his promise, cannot threaten by explicitly saying that he will not keep his word.
One‐person games of economic survival
Authors: Morrill John E. 
Published: May 2007

AbstractThis paper discusses the one‐person economic survival game model with a discrete probability distribution for the contribution to surplus variable. The general game model and strategies in these games are examined, and necessary conditions which an undominated, stationary strategy must satisfy are obtained. For a special class of these games a mathematical formulation of the value of the game is given, and examples and theorems which relate to undominated strategies in this class are presented. This paper, in some sense, is a sequel to a portion of a paper by Shubik and Thompson [7] which appeared in this journal.
Vessel allocation by linear programming
Authors: Laderman J. , Gleiberman L. , Egan J. F. 
Published: May 2007

AbstractThis paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel.
A method for solving the transportation problem
Authors: Lagemann J. J. 
Published: May 2007

AbstractA new method has been developed f o r solving the transportation problem. This method is a modification and a generalization of the method for solving the multiple assignment problem developed by Dr. A. J. Hoffman and Dr. H. M. Markowitz.This method is of interest for several reasons. In the first place it is significantly different from all other methods for solving the trans ‐portation problem known to the author. Secondly, it is moderately simple touse and understand. Thirdly, and perhaps most important, it has proved to be very adaptable tri high‐speed computer operations. It is now being used by several branches of the armed services.
An approximate solution method for the fixed charge problem
Authors: Cooper L. , Drebes C. 
Published: May 2007

AbstractIn the absence, to date, of an exact method for solving the linear programming problem with fixed charges, two heuristic methods have been proposed and extensively investigated, computationally, for moderate sized problems. The results indicate that the heuristic methods produce optimal solutions in well over 90 percent of the several hundred problems investigated and very close to optimal (a few percent) in the remaining cases. Hence it should be of practical significance to practitioners in the field.
Linear estimation of the location and scale parameters from type 11 censored samples from symmetric unimodal distributions
Authors: Chan Lai Kow 
Published: May 2007

AbstractEstimates of the location and scale parameters, linear in the order statistics of a Type II censored or complete sample, from a continuous symmetric unimodal distribution satisfying certain conditions are obtained. Their coefficients are explicit functions of the expectations of the order statistics or population quantiles from the known parameter‐free standardized distribution. Linear estimates with simpler coefficients are also obtained. The theorems state the complete sample case, and the singly and doubly censored cases. The more general case, the multiple censoring, is an extension of these cases and is indicated. All the estimates obtained are asymptotically efficient in the strict sense.
Simple stability of general n‐ person games
Authors: Marchi Ezio 
Published: May 2007

AbstractHerein are introduced noncooperative points of n‐person games defined on compact and convex sets in a Euclidean space and continuous payoff functions, which are natural extensions of the respective concepts of maximin, minimax strategies and saddle points of two‐person games. The conc:ept of equilibrium point appears as a special of one of those.As a particular case, we examine such points for the mixed extension of finite n‐person games; finally, a related topic is illustrated.These results represent the first installment of a collection which will be continued in subsequent publications.
A two‐station stochastic inventory model with exact methods of computing optimal policies
Authors: Love Robert F. 
Published: May 2007

AbstractA method is presented for calculating optimal inventory levels in a two‐station transactions reporting inventory system. The criterion of optimality is the minimization of expected cost. The computational properties of the model are stressed and the solution method is precise.It is shown that when the model represents a central warehouse which supplies several retail outlets, stocks carried at the central location affect the capacity of the system to handle orders. Stocks carried at the retail level affect only the size of the retail order backlog.
Queues with stochastic service rates
Authors: Harris Carl M. 
Published: May 2007

AbstractThe purpose of this paper is to explore an extension of the output discipline for the Poisson input, general output, single channel, first‐come, first‐served queueing system. The service time parameter, μ, is instead considered a random variable, M. In other words, the service time random variable, T, is to be conditioned by a parameter random variable, M. Therefore, if the distribution function of M is denoted by FM(μ) and the known conditional service time distribution as B(t |μ), then the unconditional service distribution is given by B(t) = Pr {T ≤ t}. = ∫‐∞∞ B(t |μ) dFM(μ).Results are obtained that characterize queue size and waiting time using the imbedded Markov chain approach. Expressions are derived for the expected queue length and Laplace‐Stieltjes transforms of the steady‐state waiting time when conditional service times are exponential. More specific results are found for three special distributions of M: (1) uniform on [1.2]; (2) two‐point; and (3) gamma.
Toward a study of bidding processes part IV ‐ games with unknown costs
Authors: Criesmer James H. , Levitan Richard E. , Shubikt Martin 
Published: May 2007

AbstractThis paper represents a continuation of three previous papers [1‐.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric.
The truck assignment problem
Authors: Szwarc Wlodzimierz 
Published: May 2007

AbstractLet us consider the following problem: A group of cement factories produces several types of cement, but each factory produces only one type. There is also a group of purchasers and each purchaser may need several types of cement. The amounts supplied and the demands are assumed to be known for each cement factory and each purchaser. Each cement factory has several trucks, but there is only one dispatcher for ail of the trucks from all of the factories. It is assumed that the entire lcad of each truck is for one purchaser only. A truck begins its workday by leaving its base depot loaded and ends its day by returning to it empty. During the day it may be required to transport cement from any of the cement factories. The distances from various factories to individual purchasers are known. The problem to be solved is that of finding a truck schedule such that cement in the needed quantities is delivered daily to the individual purchasers and in such a manner that the total truck‐kilometers traveled will be as small as possible. This paper presents the method of solution, though the assumption of an 8‐hour workday may not be met. On the other hand, there are methods developed for effecting a variety of cyclic routings which can be used to lend considerable flexibility to the schedules.
Markov chain analysis of a situation where cannibalization is the only repair activity
Authors: Rolfe Alan J. 
Published: May 2007

AbstractThis paper considers a group of S identical aircraft, each of which is partitioned into K parts which fail exponentially. The only way in which a failed aircraft can be repaired is by cannibalizing its out‐of‐commission parts from other failed aircraft. The evolution of the number of good aircraft over time is governed by the transient behavior of an absorbing Markov chain. We can therefore study this behavior by matrix multiplication although the computational problem grows large for K ≥ 3. Some numerical results and some approximations are also provided.
The optimal burn‐in testing of repairable equipment
Authors: Cozzolino John M. 
Published: May 2007

AbstractThe subject of this paper is the utilization of the “infant mortality” or decreasing failure rate effect to improve the reliability of repairable devices. Decreasing failure rate implies the possibility that devices which exhibit it can be improved by “burn‐in testing” of each unit. Such a test serves to accumulate operating time while shielded from the full costs and consequences of failure. A general formulation of the burn‐in test decision for repairable devices is presented and some special cases are solved. A class of models, indexed by the degree of partial replacement present in the repair process, is considered and numerical results for the optimal policy are given for several members of that class. A comparison of those results reveals the profitability of testing increases with the complexity of the repairable device.
Production and employment scheduling in multistage production systems
Authors: von Lanzenauer Christoph Haehling 
Published: May 2007

AbstractA model is developed for planning optimal production and employment levels in multi‐product, multistage production systems. The market requirements for each product over the planning period are given. Backorders and/or shortages are permitted. Backorders and shortages must be considered in order to determine the amount of each product's demand that should be filled, backlogged, or go unsatisfied if the production capacity is insufficient to fill all market requirements. Backorders and shortages, on the other hand, are desirable under certain dynamic market conditions.
Interception in a network
Authors: Wollmer R. D. 
Published: May 2007

AbstractThis paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another.The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available.