Sequencing Capacity Expansion Projects in Continuous Time

A. W. Neebe and M. R. Rao
Additional contact information
A. W. Neebe: Graduate School of Business Administration and Curriculum in Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, North Carolina 27514
M. R. Rao: Graduate School of Business Administration, New York University, New York, New York 10006 and Indian Institute of Management, Bangalore, India

Management Science, 1986, vol. 32, issue 11, 1467-1479

Abstract: We consider a problem of sequencing capacity expansion projects with a continuous demand function specified over a given time horizon. Each type of expansion project has a specified integer capacity and an associated cost which is nonincreasing with respect to the time at which the project is brought on stream. The problem is to determine the sequence of expansions to provide sufficient capacity to meet demand at minimum cost. A formulation is presented and its relaxation leads to a shortest route problem. The sequencing problem is solved using a branch and bound procedure with Lagrangean relaxation providing bounds. A particularly effective heuristic is also developed. Computational results are given.

Keywords: capacity expansion; Lagrangean relaxation (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.11.1467 (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:ormnsc:v:32:y:1986:i:11:p:1467-1479

Access Statistics for this article

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