A multistage benders decomposition method for production planning problems with approved vendor matrices

A production planning problem is studied based on an actual manufacturer of hard-disk drives that offers the approved vendor matrix as a competitive advantage. An approved vendor matrix allows customers to pick and choose the component suppliers for individual components or pairs of components constituting their product. The problem is to develop production plans that minimize the total tardiness in fulfilling customer orders while observing the matrix restrictions and limited component supplies. It is first shown that this problem has an equivalent multicommodity network flow representation. A solution procedure using multistage Benders decomposition is then developed. The computational efficiency of the approach is compared with the column-generation method and the CPLEX general-purpose LP solver under different scenarios of matrix restrictions.

[1]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[2]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[3]  Shabbir Ahmed,et al.  A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty , 2003, J. Glob. Optim..

[4]  Sydney C. K. Chu.  A mathematical programming approach towards optimized master production scheduling , 1995 .

[5]  Dingwei Wang.  Earliness/tardiness production planning approaches for manufacturing systems , 1995 .

[6]  Jery R. Stedinger,et al.  SOCRATES: A system for scheduling hydroelectric generation under uncertainty , 1995, Ann. Oper. Res..

[7]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[8]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[9]  Loo Hay Lee,et al.  Production planning with approved vendor matrices for a hard-disk drive manufacturer , 2005, Eur. J. Oper. Res..

[10]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  C. Floudas,et al.  Global optimum search for nonconvex NLP and MINLP problems , 1989 .

[13]  Jean-François Cordeau,et al.  A Benders Decomposition Approach for the Locomotive and Car Assignment Problem , 1998, Transp. Sci..

[14]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[15]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[16]  Robert Richardson.  An Optimization Approach to Routing Aircraft , 1976 .

[17]  Arnoldo C. Hax,et al.  Hierarchical integration of production planning and scheduling , 1973 .

[18]  Roberto Montemanni,et al.  The robust shortest path problem with interval data via Benders decomposition , 2005, 4OR.

[19]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[20]  Stavros A. Zenios,et al.  Scalable Parallel Benders Decomposition for Stochastic Linear Programming , 1997, Parallel Comput..

[21]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[22]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .