Production lot-sizing with dynamic capacity adjustment

被引:19
|
作者
Ou, Jinwen [1 ]
Feng, Jiejian [1 ]
机构
[1] Jinan Univ, Business Sch, Dept Adm Management, Guangzhou 510632, Guangdong, Peoples R China
关键词
Production; Lot-sizing; Algorithm; Capacity adjustment; LINEAR PRODUCTION COSTS; CONSTANT CAPACITIES; NP-HARD; ALGORITHMS; DEMAND; MODEL; TRANSPORTATION; ACQUISITION; DISCOUNTS; SIZE;
D O I
10.1016/j.ejor.2018.06.030
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we study a single-item lot-sizing model in which production capacity can be adjusted from time to time. There are a number of different production capacity levels available to be acquired in each period, where each capacity level is assumed to be a multiple of a base capacity unit. To reduce the waste of excess of capacity but guarantee meeting the demand, it is important to decide which level of capacity should be acquired and how many units of the item should be produced for every period in the planning horizon. Capacity adjustment cost incurs when capacity acquired in the current period differs from the one acquired in the previous period. Capacity acquisition costs, capacity adjustment costs, and production costs in each period are all time-varying and depend on the capacity level acquired in that period. Backlogging is allowed. Both production costs and inventory costs are assumed to be general concave. We provide optimal properties and develop an efficient exact algorithm for the general model. For the special cases with zero capacity adjustment costs or fixed-plus-linear production costs, we present a faster exact algorithm. Computational experiments show that our algorithm is able to solve medium-size instances for the general model in a few seconds, and that cost can be reduced significantly through flexible capacity adjustment. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:261 / 269
页数:9
相关论文
共 50 条
  • [21] Dynamic lot-sizing with setup cost reduction
    Denizel, M
    Erenguc, S
    Benson, HP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (03) : 537 - 549
  • [22] OPTIMAL LOT-SIZING FOR DYNAMIC ASSEMBLY SYSTEMS
    ROSLING, K
    LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1986, 266 : 119 - 131
  • [23] LOT-SIZING FOR TIME-PHASED PRODUCTION
    OVERFELD, J
    WITTE, T
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1992, 30 (04) : 839 - 858
  • [24] A dynamic lot-sizing model with quantity discount
    Chyr, F
    Huang, ST
    De Lai, S
    PRODUCTION PLANNING & CONTROL, 1999, 10 (01) : 67 - 75
  • [25] Dynamic knapsack sets and capacitated lot-sizing
    Marko Loparic
    Hugues Marchand
    Laurence A. Wolsey
    Mathematical Programming, 2003, 95 : 53 - 69
  • [26] A dynamic lot-sizing problem with multiple suppliers
    Xu J.-T.
    Zhang Q.-P.
    Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2010, 31 (04): : 451 - 456
  • [27] MULTISTAGE LOT-SIZING FOR GENERAL PRODUCTION SYSTEMS
    HEINRICH, CE
    SCHNEEWEISS, C
    LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1986, 266 : 150 - 181
  • [28] A Collaborative Lot-Sizing Problem with Production Limitations
    Ziebuhr, Mario
    Buer, Tobias
    Kopfer, Herbert
    2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 1005 - 1012
  • [29] Economic Lot-Sizing for Integrated Production and Transportation
    Hwang, Hark-Chin
    OPERATIONS RESEARCH, 2010, 58 (02) : 428 - 444
  • [30] Lot-sizing with production and delivery time windows
    Laurence A. Wolsey
    Mathematical Programming, 2006, 107 : 471 - 489