Sequencing Expansion Projects

Donald Erlenkotter
Additional contact information
Donald Erlenkotter: University of California, Los Angeles, California

Operations Research, 1973, vol. 21, issue 2, 542-553

Abstract: This paper examines the problem of finding the sequencing of a finite set of expansion projects that meets a deterministic demand projection at minimum discounted cost. For the particular situation defined, the tuning for a next expansion may be determined directly from knowledge of projected demand and present capacity. A dynamic programming formulation for sequencing projects is developed, and solution of an example problem demonstrates that other methods proposed for this problem are not, in general, valid. Extensions of the dynamic programming formulation to include interdependence between projects and joint selection of project scale and sequencing are indicated, and conditions for decomposition or direct solution of the sequencing problem are derived.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.2.542 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:2:p:542-553

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().