Landmarks in defense literature

Deterrence and strategy. By Andre Beaufre (translated by Maj Gen R. H. Barry CB). Faber & Faber, London (1965)     

Flowshop sequencing problem with ordered processing time matrices: A general case

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.     

Discount pricing policies for inventories subject to declining demand

Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants.     

Performance of N machine centers of K-out-of-M: G type maintained by a single repairman

We consider a system of N (nonsymmetric) machine centers of the K-out-of-M : G type that are maintained by a single repairman. [A machine center functions if and only if at least K of the M machines belonging to the center are good (G).] Such systems are commonly found in various manufacturing and service industries. A stochastic model is developed that accommodates generally distributed repair times and repairman walk times, and most repair scheduling disciplines. K-out-of-M : G type systems also appear as a modeling paradigm in reliability analysis and polling systems performance analysis. Several performance measures are derived for machine-repair systems having K-out-of-M-type centers. A simple example system is developed in detail that exposes the computations involved in modeling applications. © 1992 John Wiley & Sons, Inc.