Selection, acquisition, and allocation of manufacturing technology in a multi-period environment

被引:11
作者
Ahmed, Shabbir [2 ]
Sahinidis, Nikolaos V. [1 ]
机构
[1] Carnegie Mellon Univ, Dept Chem Engn, Pittsburgh, PA 15213 USA
[2] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
关键词
integer programming; technology selection; capacity expansion; heuristics; probabilistic analysis;
D O I
10.1016/j.ejor.2006.11.046
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses a multi-period investment problem for selection, acquisition, and allocation of alternative technology choices to meet the demand of a number of product families over a long-range planning horizon. The problem captures the essential features of many existing models for analyzing long-term trade-offs between dedicated and flexible technologies in the chemical, manufacturing, telecommunications, and service industries. We show that the general problem is N P-hard and present a solution strategy based upon perturbing the linear programming (LP) relaxation solution of a multi-period mixed-integer linear programming formulation for the problem. The key feature of the proposed strategy is a temporal capacity shifting heuristic, whereby capacity expansions are shifted to earlier time periods from amongst those periods chosen for capacity expansion by the LP relaxation solution. With mild assumptions on the problem parameters, we carry a probabilistic analysis which proves that the proposed solution approach is asymptotically optimal almost surely. Our analysis provides a sound theoretical basis for incorporating capacity shifting in existing LP relaxation-based heuristics for long-term technology planning problems in a variety of industries. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:807 / 821
页数:15
相关论文
共 21 条
[1]   Analytical investigations of the process planning problem [J].
Ahmed, S ;
Sahinidis, NV .
COMPUTERS & CHEMICAL ENGINEERING, 2000, 23 (11-12) :1605-1621
[2]   An approximation scheme for stochastic integer programs arising in capacity expansion [J].
Ahmed, S ;
Sahinidis, NV .
OPERATIONS RESEARCH, 2003, 51 (03) :461-471
[3]  
Ahmed S, 2000, Strategic planning under uncertainty: Stochastic integer programming approaches
[4]   Capacity acquisition, subcontracting, and lot sizing [J].
Atamtürk, A ;
Hochbaum, DS .
MANAGEMENT SCIENCE, 2001, 47 (08) :1081-1100
[5]  
BERMAN O, 1994, COMPUT OPER RES, V21, P557, DOI 10.1016/0305-0548(94)90104-X
[6]   COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM [J].
BITRAN, GR ;
YANASSE, HH .
MANAGEMENT SCIENCE, 1982, 28 (10) :1174-1186
[7]   LOWER BOUNDING PROCEDURES FOR MULTIPERIOD TELECOMMUNICATIONS NETWORK EXPANSION PROBLEMS [J].
CHANG, SG ;
GAVISH, B .
OPERATIONS RESEARCH, 1995, 43 (01) :43-57
[8]   OPTIMAL INVESTMENT IN PRODUCT-FLEXIBLE MANUFACTURING CAPACITY [J].
FINE, CH ;
FREUND, RM .
MANAGEMENT SCIENCE, 1990, 36 (04) :449-466
[9]   THE MULTIREGION DYNAMIC CAPACITY EXPANSION PROBLEM .2. [J].
FONG, CO ;
SRINIVASAN, V .
OPERATIONS RESEARCH, 1981, 29 (04) :800-816
[10]  
Galambos J, 1987, ASYMPTOTIC THEORY EX