Sequencing Competitive Expansion Projects

Donald Erlenkotter and J. Scott Rogers
Additional contact information
Donald Erlenkotter: University of California, Los Angeles, California
J. Scott Rogers: University of Toronto, Toronto, Ontario

Operations Research, 1977, vol. 25, issue 6, 937-951

Abstract: We develop a solution approach for finding the sequencing of a finite set of capacity expansion projects that minimizes total discounted operating and investment costs. Variable operating costs are specified through a general continuous-time function that requires projects to be competitive in a certain sense. This definition for operating costs allows the use of an optimization submodel, such as a multilocation distribution problem, to determine operating decisions. The general formulation includes several simple sequencing problems as special cases. The solution approach addresses a relaxed problem formulation that incorporates economic criteria for determining project timing decisions, and we show that a properly defined solution to the relaxed formulation solves the original problem. We also develop several refinements to the basic solution approach.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.6.937 (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:25:y:1977:i:6:p:937-951

Access Statistics for this article

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