The capacitated dynamic lot size problem with variable technology

被引:9
|
作者
Pratsini, E [1 ]
机构
[1] Miami Univ, Dept Decis Sci & Management Informat Syst, Oxford, OH 45056 USA
关键词
lot sizing; learning; heuristics; nonlinear programming;
D O I
10.1016/S0360-8352(00)00061-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Traditionally, the technological coefficients in production models were assumed to be fixed. In recent years however, researchers have used the learning curve model to represent nonlinear technological coefficients, and the dynamic lot-sizing problem with learning in setups has received attention. This article extends the research to consider capacity restrictions in the single-level, multi-item case. The research has two goals, first, to analyze the effects of setup learning on a production schedule, and second, to investigate efficient ways of solving the resulting nonlinear integer model. Previously derived algorithms do not address the issue of capacity; thus a heuristic is developed and its solution is compared with the optimal solution, where possible, or to a lower bound solution. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:493 / 504
页数:12
相关论文
共 50 条
  • [1] AN EFFICIENT ALGORITHM FOR THE CAPACITATED SINGLE ITEM DYNAMIC LOT SIZE PROBLEM
    KIRCA, O
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 45 (01) : 15 - 24
  • [2] COMPUTATIONAL-COMPLEXITY OF THE CAPACITATED LOT SIZE PROBLEM
    BITRAN, GR
    YANASSE, HH
    MANAGEMENT SCIENCE, 1982, 28 (10) : 1174 - 1186
  • [3] THE CAPACITATED MULTIITEM DYNAMIC LOT-SIZING PROBLEM
    BILLINGTON, PJ
    IIE TRANSACTIONS, 1986, 18 (02) : 217 - 219
  • [4] An effective heuristic with evolutionary algorithm for the coordinated capacitated dynamic lot-size and delivery problem
    Liu, Rui
    Wang, Sirui
    Pi, Yingying
    Qin, Quande
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 153
  • [5] The profit maximizing capacitated lot-size (PCLSP) problem
    Haugen, Kjetil K.
    Olstad, Asmund
    Pettersen, Bard I.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) : 165 - 176
  • [6] Study on fuzzy capacitated dynamic lot-sizing problem
    Xiong, H.Y.
    Yang, X.F.
    He, Y.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2001, 21 (01):
  • [7] Variable neighborhood search for the capacitated lot sizing problem with remanufacturing and overtime
    Eldalgamouny, Omar H.
    Kaoud, Essam
    Abdel-Aal, Mohammad A. M.
    IFAC PAPERSONLINE, 2022, 55 (10): : 3028 - 3033
  • [8] Lagrange relaxation algorithm for capacitated lot-size problem (CLSP) with minimum lot-size constraint
    Pan, Chang-Chun
    Yang, Gen-Ke
    Sun, Kai
    Lu, Heng-Yun
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2009, 26 (02): : 133 - 138
  • [9] AN EFFECTIVE ALGORITHM FOR THE CAPACITATED SINGLE ITEM LOT-SIZE PROBLEM
    CHUNG, CS
    FLYNN, J
    LIN, CHM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 75 (02) : 427 - 440
  • [10] APPROXIMATION FORMULATIONS FOR THE SINGLE-PRODUCT CAPACITATED LOT SIZE PROBLEM
    BITRAN, GR
    MATSUO, H
    OPERATIONS RESEARCH, 1986, 34 (01) : 63 - 74