This paper introduces methods for formulating and solving a general class of nonpreemptive resource-constrained project scheduling problems in which the duration of each job is a function of the resources committed to it. The approach is broad enough to permit the evaluation of numerous time or...

In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location...

We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of finding a 0-1 vector x that maximizes c^Tx subject to f(x) \le b where c, b \ge 0 and f is an m-vector of polynomials with non-negative coefficients. The various heuristics...

A number of recent research efforts in the area of research and development planning have indicated the necessity that the R&D project selection process be viewed as a multi-criteria decision-making problem. As a result, linear 0-1 goal programming, because of its ability to encompass multiple...

This paper describes the theory, development, and application of an optimizing procedure for solving lock box location problems. Such problems have become increasingly important to banks, corporations, and governmental agencies in their quest for more efficient cash management. Extensive...

Lagrangean techniques have had wide application to the optimization of discrete optimization problems. Inverse optimization refers to the fact that each time a Lagrangean calculation is made for a specific problem with a given resources vector, an optimal solution is obtained for a related...

We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization criteria is the sum of weighted or unweighted completion times, the sum of weighted or unweighted flow times, (with or without release...

The subject of this paper is a classification and discussion of algorithms for solution of nonlinear pure integer programming problems. The survey is organized by characterizing the mathematical form of the nonlinear optimization problems addressed by the various algorithms. If any method can be...

This paper describes a branch and bound approach for optimizing a media selection problem, namely, to choose the best set of mailing lists to maximize audience reach. Prompted by a national retailer's interest in more effective and efficient direct mail catalogue distribution, the algorithm...

This article reports a procedure developed to assist the U.S. Department of Energy in selecting a portfolio of solar energy applications experiments. The procedure has also been used in other government procurements and appears to be applicable in a variety of project funding processes. The...