Optimal Selection of Ingot Sizes Via Set Covering

In 1984, Bethlehem Steel Corporation installed a new ingot mold stripping facility at its Bethlehem Plant that is capable of handling taller ingots. In order to take maximum advantage of this new facility, we developed a two-phase, computer-based procedure for selecting optimal ingot and internal ingot mold dimensions. Phase I of this procedure generates feasible ingot and internal ingot mold dimensions consistent with both the new stripper's capability and with mill constraints. Phase II then uses a set covering approach to select the optimal ingot and internal ingot mold sizes from among the feasible sizes generated. After analyzing the model, we recommended six new rectangular mold sizes to replace seven existing sizes. To date, implementation of these new ingot and mold sizes is proceeding smoothly and realizing the projected cost reduction benefits.

[1]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[2]  Lazaros P. Mavrides.  An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location , 1979 .

[3]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[4]  L. Schrage.  Implicit representation of variable upper bounds in linear programming , 1975 .

[5]  F. J. Vasko,et al.  Hybrid heuristics for minimum cardinality set covering problems , 1986 .

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

[7]  Francis J. Vasko,et al.  A Dynamic Programming Model for Determining Continuous-Caster Configurations , 1982 .

[8]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[9]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[10]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[11]  S. Lin,et al.  Heuristic Programming as an Aid to Network Design , 1975, Networks.

[12]  Harvey M. Salkin,et al.  Set Covering by an All Integer Algorithm: Computational Experience , 1973, JACM.

[13]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[14]  Royce Beckett,et al.  Numerical Calculations and Algorithms , 1967 .

[15]  Robert E. Markland,et al.  Theory and Application of an Optimizing Procedure for Lock Box Location Analysis , 1981 .

[16]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..