Capacity acquisition, subcontracting, and lot sizing

被引:89
作者
Atamtürk, A [1 ]
Hochbaum, DS
机构
[1] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA
[2] Univ Calif Berkeley, Walter A Haas Sch Business, Berkeley, CA 94720 USA
关键词
algorithms; extreme points of polyhedra; nonspeculative costs;
D O I
10.1287/mnsc.47.8.1081.10232
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The fundamental question encountered in acquiring capacity to meet nonstationary demand over a multiperiod horizon is how to balance the trade-off between having insufficient capacity in some periods and excess capacity in others. In the former situation, part of the demand is subcontracted while, in the latter, capacity that has been paid for is rendered idle. Capacity and subcontracting decisions arise in many economic activities ranging from production capacity planning in semiconductor fabs to leasing communication networks, from transportation contracts to staffing of call centers. In this paper, we investigate the trade-offs between acquiring capacity, subcontracting, production, and holding inventory to satisfy nonstationary demand over a finite horizon. We present capacity acquisition models with holding and without holding inventory and identify forecast-robust properties of the models that restrict the dependence of optimal capacity decisions on the demand forecasts. We develop algorithms for numerous practical cost structures involving variable and fixed charges and prove that they all have polynomial time complexity. For models with inventory, we solve a sequence of constant capacity lot-sizing and subcontracting subproblems, which is also of independent interest.
引用
收藏
页码:1081 / 1100
页数:20
相关论文
共 21 条