The Multiregion Dynamic Capacity Expansion Problem, Part I

C. O. Fong and V. Srinivasan
Additional contact information
C. O. Fong: University of Malaya, Kuala Lumpur, Malaysia
V. Srinivasan: Stanford University, Stanford, California

Operations Research, 1981, vol. 29, issue 4, 787-799

Abstract: Consider the problem of determining a schedule of capacity expansions for m producing regions and a schedule of shipments from the regions to n markets so as to meet the market demands over a T -period planning horizon at minimum discounted capacity expansion and shipment costs. Both of these costs are assumed to be proportional to the amounts involved. The heuristic algorithm of this paper improves on feasible solutions by exchanging capacities between pairs of regions. The algorithm imbeds an optimization procedure to seek the best feasible solution in the direction specified by the heuristic. Computational results for both real and randomly generated problems show that the heuristic algorithm is computationally efficient and yields close to optimum solutions.

Keywords: 181; 182; 632 multiregion dynamic capacity expansion (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.4.787 (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:29:y:1981:i:4:p:787-799

Access Statistics for this article

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