论文信息 - Near-optimal solution of a two-type capacity expansion problem

Near-optimal solution of a two-type capacity expansion problem

Abstract Demand of two types is assumed to grow linearly over time. One type requires the installation of “deluxe” capacity, and the other can be served by either “deluxe” or “standard” capacity. Installation is instantaneous and “rearrangement” of demand from deluxe to standard facilities is free. It is shown that very quick heuristics, based on solutions of individual “deluxe” and “standard” capacity expansion problems treated independently, produce near-optimal solutions of the sample problem. Furthermore, the heuristics help to explain the structure of the optimal solution.

John Freidenfelds | J. Freidenfelds

[1] A. Kalotay. Capacity Expansion and Specialization , 1973 .

[2] Lynn Wilson,et al. Alternating Policies For Non-Rearrangeable Networks , 1976 .

[3] Donald Erlenkotter,et al. Note---A Dynamic Programming Approach to Capacity Expansion with Specialization , 1974 .

[4] A. Kalotay,et al. Joint Capacity Expansion Without Rearrangement , 1975 .

[5] M. R. Rao,et al. Capacity Expansion with Two Producing Regions and Concave Costs , 1975 .

[6] J. Freidenfelds. Loop plant modeling: A simple model for studying feeder capacity expansion , 1978, The Bell System Technical Journal.

[7] John Freidenfelds,et al. A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion , 1979, Oper. Res..

[8] A. S. Manne. CAPACITY EXPANSION AND PROBABILISTIC GROWTH , 1961 .

[9] F. Sinden,et al. The Replacement and Expansion of Durable Equipment , 1960 .

[10] Hanan Luss,et al. A capacity-expansion model for two facility types , 1979 .