End effects in capacity expansion models with finite horizons

Capacity expansion models are typically formulated in the context of some finite horizon. Because the firm lasts longer than the horizon, a bias can enter into the optimal solution from the model horizon chosen. Recently, Grinold [8] has proposed a “dual-equilibrium method” for ameliorating possible distortions. Although the dual-equilibrium method has superior analytical properties to other methods, it is conceptually more complex. In this paper it is shown that there are situations where the “primal-equilibrium” approach of Manne [15] provides equivalent results and that the use of annualized capital costs in the objective function, although somewhat less efficient, results in a similar model.     

The procurement problem: An integer programming problem well suited to a solution using duality

A procurement problem, as formulated by Murty [10], is that of determining how many pieces of equipment units of each of m types are to be purchased and how this equipment is to be distributed among n stations so as to maximize profit, subject to a budget constraint. We have considered a generalization of Murty's procurement problem and developed an approach using duality to exploit the special structure of this problem. By using our dual approach on Murty's original problem, we have been able to solve large problems (1840 integer variables) with very modest computational effort. The main feature of our approach is the idea of using the current evaluation of the dual problem to produce a good feasible solution to the primal problem. In turn, the availability of good feasible solutions to the primal makes it possible to use a very simple subgradient algorithm to solve the dual effectively.     

Note: “Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems”

n independent jobs are to be scheduled nonpreemptively on a single machine so as to minimize some performance measure. Federgruen and Mosheiov [2] show that a large class of such scheduling problems can be optimized by solving either a single instance or a finite sequence of instances of the so-called SQC problem, in which all the jobs have a fixed or controllable common due date and the sum of general quasiconvex functions of the job completion times is to be minimized. In this note we point out that this is not always true. In particular, we show that the algorithm proposed in [2] does not always find a global optimal schedule to the problem of minimizing the weighted sum of the mean and variance of job completion times. © 1996 John Wiley & Sons, Inc.     

Using multiple searchers in constrained-path,moving-target search problems

The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc.     

The interface of computer science and statistics

Current scientific, technical, and management progress is characterized by the generation of a tremendous amount of data for analysis. This, in turn, poses a significant challenge: to effectively and efficiently extract meaningful information from the large volume of data. Two relatively young professions, computer science and statistics, are intimately linked in any response to the challenge. They have consequently become indispensable to scientific, technical, and management progress, occupying a position at its very heart Computer science and statistics have each been separately documented by many books as well as numerous papers. However, the interface of computer science and statistics, the area of their interaction, has been documented only in part. This paper begins characterization of the entire interface by providing a structure and an historical background for it A structure for the interface is introduced initially, followed by an historical background for the interface presented in two parts. First to be summarized is the evolution of the interface from an interweaving of the mechanical prerequisites to the computer and mathematical prerequisities to computer science and of the foundations for probability and statistics. Development of statistics prior to 1900 then is reviewed.     

Optimal policy for a dynamic multi-echelon inventory model

A general multiperiod multi-echelon supply system consisting of n facilities each stocking a single product is studied. At the beginning of a period each facility may order stock from an exogenous source with no delivery lag and proportional ordering costs. During the period the (random) demands at the facilities are satisfied according to a given supply policy that determines to what extent stock may be redistributed from facilities with excess stock to those experiencing shortages. There are storage, shortage, and transportation costs. An ordering policy that minimizes expected costs is sought. If the initial stock is sufficiently small and certain other conditions are fulfilled, it is optimal to order up to a certain base stock level at each facility. The special supply policy in which each facility except facility 1 passes its shortages on to a given lower numbered facility called its direct supplier is examined in some detail. Bounds on the base stock levels are obtained. It is also shown that if the demand distribution at facility j is stochastically smaller (“spread” less) than that at another facility k having the same direct supplier and if certain other conditions are fulfilled, then the optimal base stock level (“virtual” stock out probability) at j is less than (greater than) or equal to that at facility k.     

An approach to the allocation of common costs of multi-mission systems

Many Naval systems, as well as other military and civilian systems, generate multiple missions. An outstanding problem in cost analysis is how to allocate the costs of such missions so that their true costs can be determined and resource allocation optimized. This paper presents a simple approach to handling this problem for single systems. The approach is based on the theory of peak-load pricing as developed by Marcel Boiteux. The basic principle is that the long-run marginal cost of a mission must be equal to its “price.” The implication of this is that if missions can cover their own marginal costs, they should also be allocated some of the marginal common costs. The proportion of costs to be allocated is shown to a function of not only the mission-specific marginal costs and the common marginal costs, but also of the “mission price.” Thus, it is shown that measures of effectiveness must be developed for rational cost allocation. The measurement of effectiveness has long been an intractable problem, however. Therefore, several possible means of getting around this problem are presented in the development of the concept of relative mission prices.     

Discounted production scheduling and employment smoothing

We consider the problem of minimizing the sum of production, employment smoothing, and inventory costs over a finite number of time periods where demands are known. The fundamental difference between our model and that treated in [1] is that here we permit the smoothing cost to be nonstationary, thereby admitting a model with discounting. We show that the values of the instrumental variables are nondecreasing in time when demands are nondecreasing. We also derive some asymptotic properties of optimal policies.     

Dynamic multiattribute models for mixed manpower systems

This paper reviews a wide variety of manpower and personnel models of the goal programming variety. This is done from a strategy-oriented point of view addressing the problems of interest for immediate implementation as well as basic problems of manpower model research development. Particular emphasis in this paper is concerned with how analytical models can be brought to bear on the problems of combining military and civilian manpower into one management system. This includes a discussion of the computer support arrangements necessary to implement the models. First, we discuss an extension of multilevel models to provide an integrated approach to program planning which includes the dynamics of the manpower requirements-inventory relationships of mixed military-civilian manpower systems. Then, focus is given to some of the potential Navy applications particularly in terms of ways the outputs from the global multilevel model might be interfaced with assignment models for operational planning. The paper concludes with a discussion of static and dynamic multiattribute assignment models which operate on the individual man-job matching level. It is at this level of detail that dynamic mixed manpower systems might be constructed for use in equal employment opportunity planning and for local organization design studies.