A stochastic production planning problem with nonlinear cost

被引:25
|
作者
Tang, Lixin [1 ]
Che, Ping [1 ,2 ]
Liu, Jiyin [1 ,3 ]
机构
[1] Northeastern Univ, Logist Inst, Liaoning Key Lab Mfg Syst & Logist, Shenyang 110004, Peoples R China
[2] Northeastern Univ, Dept Math, Shenyang 110004, Peoples R China
[3] Univ Loughborough, Sch Business, Loughborough LE11 3TU, Leics, England
基金
中国国家自然科学基金;
关键词
Stochastic production planning; Inventory; Scenario-based approach; Stepwise Lagrangian relaxation; Variable splitting; MINLP; GENERALIZED ASSIGNMENT PROBLEM; LOT-SIZING PROBLEMS; OPTIMIZATION; UNCERTAINTY; DEMAND; DECOMPOSITION; HEURISTICS; ALGORITHMS; CAPACITY; MODELS;
D O I
10.1016/j.cor.2011.09.007
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Most production planning models are deterministic and often assume a linear relation between production volume and production cost. In this paper, we investigate a production planning problem in a steel production process considering the energy consumption cost which is a nonlinear function of the production quantity. Due to the uncertain environment, the production demands are stochastic. Taking a scenario-based approach to express the stochastic demands according to the knowledge of planners on the demand distributions, we formulate the stochastic production planning problem as a mixed integer nonlinear programming (MINLP) model. Approximated with the piecewise linear functions, the MINLP model is transformed into a mixed integer linear programming model. The approximation error can be improved by adjusting the linearization ranges repeatedly. Based on the piecewise linearization, a stepwise Lagrangian relaxation (SLR) heuristic for the problem is proposed where variable splitting is introduced during Lagrangian relaxation (LR). After decomposition, one subproblem is solved by linear programming and the other is solved by an effective polynomial time algorithm. The SLR heuristic is tested on a large set of problem instances and the results show that the algorithm generates solutions very close to optimums in an acceptable time. The impact of demand uncertainty on the solution is studied by a computational discussion on scenario generation. (C) 2011 Published by Elsevier Ltd.
引用
收藏
页码:1977 / 1987
页数:11
相关论文
共 50 条