A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
Advanced Search
Volume 2 Issue 2
Apr.  2015

IEEE/CAA Journal of Automatica Sinica

  • JCR Impact Factor: 15.3, Top 1 (SCI Q1)
    CiteScore: 23.5, Top 2% (Q1)
    Google Scholar h5-index: 77， TOP 5
Turn off MathJax
Article Contents
Article Navigation >  IEEE/CAA Journal of Automatica Sinica  > 2015  >  2(2): 217-225
Hao Liu, Qianchuan Zhao, Ningjian Huang and Xiang Zhao, "Production Line Capacity Planning Concerning Uncertain Demands for a Class of Manufacturing Systems with Multiple Products," IEEE/CAA J. of Autom. Sinica, vol. 2, no. 2, pp. 217-225, 2015.
Citation: Hao Liu, Qianchuan Zhao, Ningjian Huang and Xiang Zhao, "Production Line Capacity Planning Concerning Uncertain Demands for a Class of Manufacturing Systems with Multiple Products," IEEE/CAA J. of Autom. Sinica, vol. 2, no. 2, pp. 217-225, 2015.
shu

Production Line Capacity Planning Concerning Uncertain Demands for a Class of Manufacturing Systems with Multiple Products

  • 1. Center for Intelligent and Networked Systems(CFINS), Department of Automation, TNList Lab, Tsinghua University, Beijing 100084, China;

  • 2. Research and Development Center, Institute of Space System Engineering, China Academy of Space Technology, Beijing 100094, China;

  • 3. Center for Intelligent and Networked Systems(CFINS), Department of Automation, TNList Lab, Tsinghua University, Beijing 100084, China;

  • 4. Global Research and Development Center, General Motors Company, Warren, MI 48090, USA

Funds:

This work was supported by a contract between General Motors Company and Tsinghua University, National Natural Science Foundation of China (61425027, 60736027, 61021063, 61074034, 61174105).

    Abstract
  • In this paper, we study a class of manufacturing systems which consist of multiple plants and each of the plants has capability of producing multiple distinct products. The production lines of a certain plant may switch between producing different kinds of products in a time-sharing mode. We optimize the capacity configuration of such a system's production lines with the objective to maximize the overall profit in the capacity planning horizon. Uncertain demand is incorporated in the model to achieve a robust configuration solution. The optimization problem is formulated as a nonlinear polynomial stochastic programming problem, which is difficult to be efficiently solved due to demand uncertainties and large search space. We show the NP-hardness of the problem first, and then apply ordinal optimization (OO) method to search for good enough designs with high probability. At lower level, an mixed integer programming (MIP) solving tool is employed to evaluate the performance of a design under given demand profile.

     

    • FullText(HTML)
  • loading
    • References(14)
  • [1]
    Fleischmann B, Ferber S, Henrich P. Strategic planning of BMW's global production network. Interfaces, 2006, 36(3):194-208
    [2]
    Kauder S, Meyr H. Strategic network planning for an international automotive manufacturer:balancing flexibility and economical efficiency. OR Spectrum, 2009, 31(3):507-532
    [3]
    Bihlmaier R, Koberstein A, Obst R. Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty. OR Spectrum, 2009, 31(2):311-336
    [4]
    Lin J T, Wu C H, Chen T L, Shih S H. A stochastic programming model for strategic capacity planning in thin film transistor-liquid crystal display (TFT-LCD) industry. Computers & Operations Research, 2011, 38(7):992-1007
    [5]
    Zhang R Q, Zhang L K, Xiao Y Y, Kaku I. The activity-based aggregate production planning with capacity expansion in manufacturing systems. Computers & Industrial Engineering, 2012, 62(2):491-503
    [6]
    Kulkarni A A, Shanbhag U V. Recourse-based stochastic nonlinear programming:properties and benders-SQP algorithms. Computational Optimization and Applications, 2012, 51(1):77-123
    [7]
    Chien C F, Wu J Z, Wu C C. A two-stage stochastic programming approach for new tape-out allocation decisions for demand fulfillment planning in semiconductor manufacturing. Flexible Services and Manufacturing Journal, 2013, 25(3):286-309
    [8]
    Ho Y C, Zhao Q C, Jia Q S. Ordinal Optimization:Soft Optimization for Hard Problems. New York:Springer, 2007.
    [9]
    Birge J R, Louveaux F. Introduction to Stochastic Programming. New York:Springer, 1997.
    [10]
    Sherali H D, Tuncbilek C H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization, 1992, 2(1):101-112
    [11]
    Glover F, Woolsey E. Converting the 0-1 polynomial programming problem to a 0-1 linear program. Operations Research, 1974, 22(1):180-182
    [12]
    IBM ILOG CPLEX. ILOG CPLEX 11. 0 User's Manual. France, 2007.
    [13]
    Bass F M. A new product growth for model consumer durables. Management Science, 1969, 15(5):215-227
    [14]
    Chen C H, Lin J W, Yücesan E, Chick S E. Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems, 2000, 10(3):251-270
    • Related Articles
    • Supplements(0)

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (1114) PDF downloads(12) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return