Accession Number : AD0717944

Title :   The Sequencing of Expansion Projects,

Corporate Author : CALIFORNIA UNIV LOS ANGELES WESTERN MANAGEMENT SCIENCE INST

Personal Author(s) : Erlenkotter,Donald

Report Date : NOV 1970

Pagination or Media Count : 39

Abstract : The paper examines the problem of finding the sequencing of a set of expansion projects which meets a given demand projection at minimum cost. For the particular type of situation defined, the timing for a next expansion may be determined from knowledge of projected demand and present capacity. Under suitable restrictions, a simple ranking of the projects can be constructed which provides an optimal sequencing. A dynamic programming method for sequencing projects which appears to work well in many situation shas been proposed by Butcher, Haimes, and Hall. However, this method fails to solve an example problem with four projects. The expansion sequencing problem is closely related to the traveling salesman problem, and a general solution method is developed for sequencing projects which is similar to the solution of traveling salesman problems by dynamic programming on the unit hypercube. This dynamic programming method may be extended to include interdependence between projects and joint selection of project scale and sequencing. (Author)

Descriptors :   (*DYNAMIC PROGRAMMING, SEQUENCES(MATHEMATICS)), (*PRODUCTION CONTROL, MANAGEMENT PLANNING AND CONTROL), GAME THEORY, DECISION THEORY, INTEGRALS, NUMERICAL INTEGRATION, SET THEORY, OPTIMIZATION

Subject Categories : Administration and Management
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE