Dynamic lot-sizing model under perishability, substitution, and limited storage capacity

被引:22
|
作者
Jing, Fuying [1 ]
Mu, Yinping [2 ]
机构
[1] Chongqing Technol & Business Univ, Natl Res Base Intelligent Mfg Serv, Chongqing 400067, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
Dynamic lot-sizing; Perishable inventory; Product substitution; Limited storage capacity; LOOP SUPPLY CHAIN; SIZE MODEL; BOUNDED INVENTORY; FORECAST HORIZONS; POLYNOMIAL ALGORITHM; DEMAND SUBSTITUTION; PLANNING PROBLEMS; HEURISTICS; POLICIES; SETUPS;
D O I
10.1016/j.cor.2020.104978
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Various commodities including blood, pharmaceutical, and agricultural products are perishable in nature and require special storage conditions, such as controlled temperature. However, expanding the space of cold storage is expensive. Therefore, storage capacity frequently restricts the operational efficiency of enterprises in the perishable product industry. Numerous enterprises have adopted the policies of product substitution and multiple item joint procurement to achieve an efficient inventory management and reduce their operation costs. This paper considers a two-product dynamic lot-sizing problem for perishable inventory under product substitution and limited storage capacity. This study aims to identify the ordering, inventory, and substitution decisions over a planning horizon under the criteria that (i) the inventory holding costs and deterioration rates are age dependent, (ii) a one-direction product substitution and joint ordering of two products are possible, and (iii) the storage capacity has an upper bound that limits the inventory quantities. The contributions of this study are summarized in three points. First, we develop a dynamic programming algorithm by using two structural properties to solve the dynamic lot-sizing problem with perishable inventory and demand substitution under storage capacity constraints. Second, we obtain the forecast horizons for the general problem by using the marginal analysis method and for the case with constant unit ordering costs through establishing the monotonicity of the regeneration points of two products. Third, we determine the effects of storage capacity, product lifetime, joint setup, and inventory costs on the length of the forecast horizon and the total costs by using a detailed test bed of instances. The major findings are also discussed in three aspects. First, the single-period satisfaction property fails to hold under limited storage capacity and time-varying unit ordering costs. Second, the forecast horizon inconsistently increases with joint setup costs or storage capacity. Third, the total costs fail to decrease with increasing storage capacity or product lifetime. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] THE CAPACITATED MULTIITEM DYNAMIC LOT-SIZING PROBLEM
    BILLINGTON, PJ
    IIE TRANSACTIONS, 1986, 18 (02) : 217 - 219
  • [32] SENSITIVITY ANALYSIS OF DYNAMIC LOT-SIZING HEURISTICS
    PAN, CH
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1994, 22 (03): : 251 - 261
  • [33] Dynamic knapsack sets and capacitated lot-sizing
    Loparic, M
    Marchand, H
    Wolsey, LA
    MATHEMATICAL PROGRAMMING, 2003, 95 (01) : 53 - 69
  • [34] Coordination of dynamic lot-sizing in supply chains
    Albrecht, Martin
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2017, 68 (03) : 322 - 330
  • [35] A parallel algorithm for the dynamic lot-sizing problem
    Lyu, JJ
    Lee, MC
    COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 41 (02) : 127 - 134
  • [36] Economic lot-sizing and dynamic quantity competition
    Transchel, Sandra
    Minner, Stefan
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2011, 133 (01) : 416 - 422
  • [37] Dynamic lot-sizing with setup cost reduction
    Denizel, M
    Erenguc, S
    Benson, HP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 100 (03) : 537 - 549
  • [38] OPTIMAL LOT-SIZING FOR DYNAMIC ASSEMBLY SYSTEMS
    ROSLING, K
    LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1986, 266 : 119 - 131
  • [39] 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
  • [40] Dynamic knapsack sets and capacitated lot-sizing
    Marko Loparic
    Hugues Marchand
    Laurence A. Wolsey
    Mathematical Programming, 2003, 95 : 53 - 69