IBM®
Skip to main content
    Country/region [change]    Terms of use
 
 
 
    Home    Products    Services & solutions    Support & downloads    My account    

IBM Journal of Research and Development
Business Optimization   Volume 51, Number 3/4, 2007
Table of contents: HTMLPDF This article: HTMLPDF   Copyright info

Production design for plate products in the steel industry - References

 by S. Dash,
J. Kalagnanam,
C. Reddy,
and S. H. Song
References

  1. G. Dutta and R. Fourer, “A Survey of Mathematical Programming Applications in Integrated Steel Plants,” Manuf. & Service Oper. Manage. 3, No. 4, 387–400 (2001).
  2. O. Porto, F. Menezes, L. Moreno, and E. Uchoa, “Optimization of the Continuous Casting Phase in Steel Tubes Production,” Proceedings of the 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, 2006; see http://www.ismp2006.org/Informacoes/detailedprogram.php.
  3. I. Harjunkoski and I. E. Grossman, “A Decomposition Approach for the Scheduling of a Steel Plant Production,” Computers & Chem. Eng. 25, No. 11, 1647–1660 (2001).
  4. S. Y. Chang, M.-R. Chang, and Y. Hong, “A Lot Grouping Algorithm for a Continuous Slab Caster in an Integrated Steel Mill,” Production Planning & Control 11, No. 4, 363–368 (2000).
  5. D. Pacciarelli and M. Pranzo, “Production Scheduling in a Steelmaking–Continuous Casting Plant,” Computers & Chem. Eng. 28, No. 12, 2823–2835 (2004).
  6. H. S. Lee, S. S. Murthy, S. W. Haider, and D. V. Morse, “Primary Production Scheduling at Steelmaking Industries,” IBM J. Res. & Dev. 40, No. 2, 231–252 (1996).
  7. P. C. Gilmore and R. E. Gomory, “A Linear Programming Approach to the Cutting Stock Problem,” Oper. Res. 9, No. 6, 849–859 (1961).
  8. P. Gilmore and R. Gomory, “A Linear Programming Approach to the Cutting Stock Problem—Part II,” Oper. Res. 11, No. 6, 863–888 (1963).
  9. F. Vanderbeck, “A Nested Decomposition Approach to a Three-Stage Two-Dimensional Cutting-Stock Problem,” Manage. Sci. 47, No. 6, 864–879 (2001).
  10. S. Michel, N. Perrot, and F. Vanderbeck, “Knapsack Problems with Setups,” Working Paper No. U-04.03, Department of Applied Mathematics, Université Bordeaux, Talence Cedex, France, 2007; see http://www.math.u-bordeaux.fr/~fv/papers/fcknpPap.pdf.
  11. M. A. Vonderembse and R. W. Haessler, “A Mathematical Programming Approach to Schedule Master Slab Casters in the Steel Industry,” Manage. Sci. 28, No. 12, 1450–1461 (1982).
  12. A. Lodi, S. Martello, and D. Vigo, “Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems,” INFORMS J. Computing 11, No. 4, 345–357 (1999).
  13. A. Fritsch and O. Vornberger, “Cutting Stock by Iterated Matching,” Proceedings of the International Conference on Operations Research, Berlin, Germany, 1995, pp. 92–97.
  14. Z. Degraeve and L. Schrage, “Optimal Integer Solutions to Industrial Cutting Stock Problems,” INFORMS J. Computing 11, No. 4, 406–419 (1999).
  15. Z. Degraeve and M. Peeters, “Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results,” INFORMS J. Computing 15, No. 1, 58–81 (2003).
  16. D. L. Applegate, L. S. Buriol, B. L. Dillard, D. S. Johnson, and P. W. Shor, “The Cutting-Stock Approach to Bin Packing: Theory and Experiments,” Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX), Baltimore, MD, 2003, pp. 12–15.
  17. F. J. Vasko, D. D. Newhart, and K. L. Stott, “A Hierarchical Approach for One-Dimensional Cutting Stock Problems in the Steel Industry that Maximizes Yield and Minimizes Overgrading,” Euro. J. Oper. Res. 114, No. 1, 72–82 (1999).
  18. J. R. Kalagnanam, M. W. Dawande, M. Trumbo, and H. S. Lee, “The Surplus Inventory Matching Problem in the Process Industry,” Oper. Res. 48, No. 4, 505–516 (2000).
  19. M. Dawande, J. Kalagnanam, H. S. Lee, C. Reddy, S. Siegel, and M. Trumbo, “The Slab-Design Problem in the Steel Industry,” Interfaces 34, No. 3, 215–225 (2004).
  20. J. J. H. Forrest, J. Kalagnanam, and L. Ladanyi, “A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints,” INFORMS J. Computing 18, No. 1, 129–134 (2006).
  21. U. I. Gupta, D. T. Lee, and J. Y.-T. Leung, “Efficient Algorithms for Interval Graphs and Circular-Arc Graphs,” Networks 12, No. 4, 459–467 (1982).
  22. H. S. Lee and M. Trumbo, “An Approximate 0–1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem,” Proceedings of the 15th International Joint Conference on Artificial Intelligence, Nagoya, Japan, 1997, pp. 1402–1411.
  23. J. L. Bentley, “Experiments on Traveling Salesman Heuristics,” Proceedings of the 1st Annual ACM–SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1990, pp. 91–99.


    About IBM    Privacy    Contact