Production line capacity planning concerning uncertain demands for a class of manufacturing systems with multiple products

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 system0s 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.

[1]  Bernhard Fleischmann,et al.  Strategic Planning of BMW's Global Production Network , 2006, Interfaces.

[2]  Achim Koberstein,et al.  Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty , 2009, OR Spectr..

[3]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[4]  Herbert Meyr,et al.  Strategic network planning for an international automotive manufacturer , 2009, OR Spectr..

[5]  Chen-Fu Chien,et al.  A two-stage stochastic programming approach for new tape-out allocation decisions for demand fulfillment planning in semiconductor manufacturing , 2013 .

[6]  Ikou Kaku,et al.  The activity-based aggregate production planning with capacity expansion in manufacturing systems , 2012, Comput. Ind. Eng..

[7]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[8]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[9]  Cheng-Hung Wu,et al.  A stochastic programming model for strategic capacity planning in thin film transistor-liquid crystal display (TFT-LCD) industry , 2011, Comput. Oper. Res..

[10]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[11]  F. Bass A new product growth model for consumer durables , 1976 .

[12]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[13]  Frank M. Bass,et al.  A New Product Growth for Model Consumer Durables , 2004, Manag. Sci..

[14]  Ankur A. Kulkarni,et al.  Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms , 2012, Comput. Optim. Appl..

[15]  Y. Ho,et al.  Ordinal Optimization: Soft Optimization for Hard Problems , 2007 .