The Surplus Inventory Matching Problem in the Process Industry

We introduce a new problem that arises from operations planning in the process industry. This problem involves matching an order book against surplus inventory before production planning. It can be formulated by generalizing the multiple knapsack problem along three dimensions: (i) adding assignment restrictions on items that can be assigned to a knapsack, (ii) adding a new attribute (called "color" in this paper) to an item and then adding the associated "color" constraints that restrict the number of distinct colors that can be assigned to a knapsack, and (iii) considering multiple objectives for optimization. We formulate the problem, provide a result regarding its complexity, and report on our computational experience with solving a set of real instances based on data from the operations of a large steel plant. We then propose a network-flow--based heuristic that yields solutions within 3% of optimal (or the best known feasible solution). This system has been successfully deployed and is now used daily in the mill operations.

[1]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[2]  M. Trick.  A Linear Relaxation Heuristic for the Generalized Assignment Problem , 1992 .

[3]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[5]  Paolo Toth,et al.  A Bound and Bound algorithm for the zero-one multiple knapsack problem , 1981, Discret. Appl. Math..

[6]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[7]  S. Martello,et al.  Solution of the zero-one multiple knapsack problem , 1980 .

[8]  Milind Dawande,et al.  Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[9]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  M. R. Rao,et al.  The generalized assignment problem: Valid inequalities and facets , 1990, Math. Program..

[12]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[13]  John C. Fisk,et al.  An algorithm for 0‐1 multiple‐knapsack problems , 1978 .

[14]  C. E. Ferreira,et al.  Solving Multiple Knapsack Problems by Cutting Planes , 1996, SIAM J. Optim..

[15]  Paolo Toth,et al.  Optimal and canonical solutions of the change making problem , 1980 .

[16]  S. Martello,et al.  Heuristische Algorithmen zur Packung von mehreren Rucksäcken , 1981 .

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..