• DocumentCode
    3156537
  • Title

    A general approach to multi-item capacitated dynamic lot-sizing problems

  • Author

    Li, Yanzhi ; Tao, Yi ; Wang, Fan

  • Author_Institution
    Dept. of Manage. Sci., City Univ. of Hong Kong, Hong Kong, China
  • fYear
    2009
  • fDate
    6-9 July 2009
  • Firstpage
    797
  • Lastpage
    802
  • Abstract
    In this paper, we solve the multi-item capacitated dynamic lot-sizing problems, where each item faces a series of dynamic demand and in each period, multiple items share limited production resources. The objective is to find the optimal production plan so as to minimize the total cost, including production cost, inventory holding cost, and fixed setup cost. We consider both single-level and multi-level cases; in the multi-level case, some items are consumed in order to produce some other items and therefore, items face internally generated demands in addition to external demands. We propose a simple two-stage approach, which is applicable to both classes of problems. Extensive experiments show that the approach gives very good performance compared with the existing methods. We then provide an analysis on how the superior performance is achieved. Besides its performance, one appealing feature of our method is its simplicity and general applicability.
  • Keywords
    costing; lot sizing; minimisation; production planning; resource allocation; cost minimization; dynamic demand; fixed setup cost; inventory holding cost; multiitem capacitated dynamic lot-sizing problem; optimal production plan; production cost; production resource sharing; Cost function; Genetic algorithms; Lot sizing; Manufacturing; Mathematical programming; Performance analysis; Production planning; Sun; capacitated; dynamic lot-sizing; multi-item; multi-level; production planning; single-level;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
  • Conference_Location
    Troyes
  • Print_ISBN
    978-1-4244-4135-8
  • Electronic_ISBN
    978-1-4244-4136-5
  • Type

    conf

  • DOI
    10.1109/ICCIE.2009.5223912
  • Filename
    5223912