Temporal and spatial Lagrangean decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers

Abstract We address in this paper the optimization of a multi-site, multi-period, and multi-product planning problem with sequence-dependent changeovers, which is modeled as a mixed-integer linear programming (MILP) problem. Industrial instances of this problem require the planning of a number of production and distribution sites over a time span of several months. Temporal and spatial Lagrangean decomposition schemes can be useful for solving these types of large-scale production planning problems. In this paper we present a theoretical result on the relative size of the duality gap of the two decomposition alternatives. We also propose a methodology for exploiting the economic interpretation of the Lagrange multipliers to speed the convergence of numerical algorithms for solving the temporal and spatial Lagrangean duals. The proposed methods are applied to the multi-site multi-period planning problem in order to illustrate their computational effectiveness.

[1]  S. M. S. Neiro,et al.  Langrangean decomposition applied to multiperiod planning of petroleum refineries under uncertainty , 2006 .

[2]  M. Guignard Lagrangean relaxation , 2003 .

[3]  I. Grossmann,et al.  Temporal Decomposition Scheme for Nonlinear Multisite Production Planning and Distribution Models , 2003 .

[4]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[5]  R. Ocampo-Pérez,et al.  Adsorption of Fluoride from Water Solution on Bone Char , 2007 .

[6]  José M. Pinto,et al.  Lagrangean-based techniques for the supply chain management of flexible process networks , 2008, Comput. Chem. Eng..

[7]  R. Bellman,et al.  Linear Programming and Economic Analysis. , 1960 .

[8]  H. P. Williams Duality in mathematics and linear and integer programming , 1996 .

[9]  Dan Wu,et al.  Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update , 2006, Comput. Chem. Eng..

[10]  Ignacio E. Grossmann,et al.  Simultaneous planning and scheduling of single-stage multi-product continuous plants with parallel lines , 2008, Comput. Chem. Eng..

[11]  C. Maranas,et al.  A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems , 1999 .

[12]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[13]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.