A Capacity Expansion Strategy On Project Planning

ETRI Journal

关键词: A Capacity Expansion Strategy On Project Planning;   

Others  :  1183945
DOI  :  10.4218/etrij.94.0194.0004

【 摘 要 】

A capacity expansion planning problem with buy-or-lease decisions is considered. Demands for capacity are deterministic and are given period-dependently at each period. Capacity additions occur by buying or leasing a capacity, and leased capacity at any period is reconverted to original source after a fixed length of periods, say, lease period. All cost functions (buying, leasing and idle costs) are assumed to be concave. And shortages of capacity and disposals are not considered. The properties of an optimal solution are characterized. This is then used in a tree search algorithm for the optimal solution and other two algorithms for a near-optimal solution are added. And these algorithms are illustrated with numerical examples.

   

【 参考文献 】

• [1]Kalotay, A.J., Capacity Expansion and Specialization," Management Science, Vol.20, No.1, pp.56-64, 1973.
• [2]Erlenkotter, D., "A Dynamic Approach to Capacity Expansion with Specialization, Management Science, Vol.21, No.3, pp.360-362, 1974.
• [3]Fong, CO. and Rao, M.R., "Capacity Expansion with Two Producing Regions and Concave Costs," Management Science, Vol.22, No.3, pp.291-303, 1979.
• [4]Gascon, A. and Leachman, R.C., "A Dynamic Programming Solution to the Dynamic, Multi-item Single-machine Scheduling Problem," Operations Research, Vol.36, No.1, pp.50-56, 1988.
• [5]Dutta, A. and Lim, J.I., "A Multi period Capacity Planning Model for Backbone Computer Communication Networks, Operations Research, Vol. 40, No.4, pp. 689-705, 1992.
• [6]Lee, S.B., "A Dynamic Lot-Size Model with Make-or-Buy Decisions" in Topics in Dynamic Lot-Sizing, Ph. D. dissertation, Graduate School of Arts and Sciences, University of Columbia, 1985, pp.9-26.
• [7]Sung, C.S., "A Single-Product Parallel- Facilities Production-Planning Model," International Journal of Systems Science, Vol.17, No.7, pp.983-989, 1986.
• [8]Kamien, M.I. and Li, L., "Subcontracting, Coordination, Flexibility, and Production Smoothing in Aggregate Planning, Management Science, Vol.36, No.11, pp. 1352-1363, 1990.
• [9]Baker, K.R., Dixon, P., Magazine M.J. and Silver, E.A., "An Algorithm for The Dynamic Lot-Size Problem with Time- Varying Production Capacity Constraints," Management Science, Vol.24, No.16, pp 1710-1720, 1978.
• [10]Ibaraki, T., "The Power of Dominance Relations in Branch-and-Bound Algorithms, Journal of the Association for Computing Machinery, Vol.24, No.2, pp. 264-279, 1977.
• [11]Hiller, R.S. and Shapiro. J.F., "Optimal Capacity Expansion Planning when There Are Learning Effects," Management Science, Vol.32, No.9, pp. 1153-1163, 1986.
• [12]Zangwill, W.I., "Minimum Concave Cost Flows in Certain Networks, Management Science, No.7, pp.429-450, 1968.