The Discrete-Time Sequencing Expansion Problem

A. W. Neebe and M. R. Rao
Additional contact information
A. W. Neebe: The University of North Carolina, Chapel Hill, North Carolina
M. R. Rao: New York University, New York, New York, and Indian Institute of Management, Bangalore, India

Operations Research, 1983, vol. 31, issue 3, 546-558

Abstract: We consider a sequencing expansion problem in which capacity can be added only at discrete points in time. Given is a forecast of demand in each period, and a set of expansion projects each with a given capacity and cost. The problem is to determine the sequence of expansions necessary to provide sufficient capacity to meet the demand in all periods at minimum cost. The problem is solved using Lagrangean relaxation. Computational results are given.

Keywords: 182; capacity; expansion (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.3.546 (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:31:y:1983:i:3:p:546-558

Access Statistics for this article

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