SENSITIVITY ANALYSIS OF DYNAMIC LOT-SIZING HEURISTICS

被引:4
|
作者
PAN, CH
机构
来源
关键词
DYNAMIC LOT-SIZING PROBLEM; SENSITIVITY; ANALYSIS; HEURISTICS; SETUP COST; HOLDING COST;
D O I
10.1016/0305-0483(94)90038-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The deciding factors in making lot-sizing decisions are demand pattern, setup cost and holding cost. In reality, setup cost and holding cost are never really known. It is more reasonable to assume that these costs are known only within some given ranges. Therefore, it is important to understand the effects that parameter uncertainty may have on the inventory replenishment plans. This paper presents the sensitivity analysis of six well-known lot-sizing heuristics. Computational results show that the economic order quantity policy is the most sensitive method to errors in parameter estimation while the Silver-Meal heuristic is the most insensitive one. It is also concluded that the optimal solutions of dynamic lot-sizing problems are robust.
引用
收藏
页码:251 / 261
页数:11
相关论文
共 50 条
  • [1] An extension for dynamic lot-sizing heuristics
    Beck, Fabian G.
    Grosse, Eric H.
    Tessmann, Ruben
    [J]. PRODUCTION AND MANUFACTURING RESEARCH-AN OPEN ACCESS JOURNAL, 2015, 3 (01): : 20 - 35
  • [2] HEURISTICS FOR MULTILEVEL LOT-SIZING WITH A BOTTLENECK
    BILLINGTON, PJ
    MCCLAIN, JO
    THOMAS, LJ
    [J]. MANAGEMENT SCIENCE, 1986, 32 (08) : 989 - 1006
  • [3] SENSITIVITY ANALYSIS OF THE ECONOMIC LOT-SIZING PROBLEM
    VANHOESEL, S
    WAGELMANS, A
    [J]. DISCRETE APPLIED MATHEMATICS, 1993, 45 (03) : 291 - 312
  • [4] AVERAGE COST ESTIMATION OF LOT-SIZING HEURISTICS
    RICHTER, K
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1992, 26 (1-3) : 341 - 345
  • [5] Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
    Kang, Yongha
    Albey, Erinc
    Uzsoy, Reha
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 54 - 65
  • [6] Heuristics for Dynamic Lot-Sizing with Plan Setup Cost in a Rolling Horizon Environment
    Choi, Yooseong
    Jeong, In-Jae
    [J]. ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 1, PROCEEDINGS, 2008, : 133 - 138
  • [7] Worst case analysis of Relax and Fix heuristics for lot-sizing problems
    Absi, Nabil
    van den Heuvel, Wilco
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 279 (02) : 449 - 458
  • [8] DYNAMIC LOT-SIZING WITH SETUP REDUCTION
    HONG, JD
    HAYYA, JC
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 24 (02) : 209 - 218
  • [9] Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
    Piperagkas, G. S.
    Konstantaras, I.
    Skouri, K.
    Parsopoulos, K. E.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1555 - 1565
  • [10] Heuristics for the Single-Item Dynamic Lot-Sizing Problem with Rework of Internal Returns
    Rudert, Steffen
    Buscher, Udo
    [J]. COMPUTATIONAL LOGISTICS (ICCL 2022), 2022, 13557 : 425 - 440