The slab-design problem in the steel industry

Interfaces

Volumn 34, Issue 3, 2004, Pages

  Dawande, Milind ^a   Kalagnanam, Jayant ^b   Lee, Ho Soo ^b   Reddy, Chandra ^b   Siegel, Stuart ^b   Trumbo, Mark ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Industries: mining, metals; Planning; Production: scheduling

Indexed keywords

EID: 3042771395     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.1040.0077     Document Type: Article

References (23)

1. Ahuja, A. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice Hall, Englewood Cliffs, NJ.
2. Coffman, E. G., M. R. Garey, D. S. Johnson. 1997. Approximation algorithms for bin packing: A survey. D. S. Hochbaum, ed. Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA.
3. Denton, B., D. Gupta, K. Jawahir. 2003. Managing increasing product variety at integrated steel mills. Interfaces 33(2) 41-53.
4. Friesen, D. K., M. A. Langston. 1986. Variable sized bin packing. SIAM J. Comput. 15(1) 222-230.
5. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9(6) 849-859.
6. Gilmore, P. C., R. E. Gomory. 1963. A linear programming approach to the cutting stock problem, Part II. Oper. Res. 11(6) 863-888.
7. Hirayama, K., H. Kajihara, Y. Nakagawa. 1996. Application of a hybrid genetic algorithm to the slab design problem. Trans. Inst. Systems, Control Inform. Engineers 9(1) 395-402.
8. Horowitz, E., S. Sahni. 1978. Fundamentals of Data Structures. Computer Science Press Inc., Rockville, MD.
9. Johnson, D. S. 1974. Fast algorithms for bin packing. J. Computer System Sci. 8(3) 272-314.
10. Kalagnanam, J., M. Dawande, M. Trumbo, H. S. Lee. 2000. The inventory matching problem in the process industry. Oper. Res. 48(4) 505-516.
11. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York.
12. Martello, S., P. Toth. 1981. A branch and bound algorithm for the zero-one multiple knapsack problem. Discrete Appl. Math. 3(4) 275-288.
13. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, Chichester, U.K.
14. Newhart, D. D., K. L. Stott, F. J. Vasko. 1993. Consolidating product sizes to minimize inventory levels for a multi-stage production and distribution system. J. Oper. Res. Soc. 44(7) 637-644.
15. Papadimitriou, C. H., K. Steiglitz. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ.
16. Vasko, F. J., F. E. Wolf. 1994. A practical approach for determining rectangular stock sizes. J. Oper. Res. Soc. 45(3) 281-286.
17. Vasko, F. J., D. D. Newhart, K. L. Stott. 1999. A hierarchical approach for one dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading. Eur. J. Oper. Res. 114(1) 72-82.
18. Vasko, F. J., F. E. Wolf, J. A. McNamara. 1989. A multiple criteria approach to dynamic cold ingot substitution. J. Oper. Res. Soc. 40(4) 361-366.
19. Vasko, F. J., F. E. Wolf, K. L. Stott. 1987. Optimal selection of ingot sizes via set covering. Oper. Res. 35(3) 346-352.
20. Vasko, F. J., M. L. Cregger, D. D. Newhart, K. L. Stott. 1993. A real-time one-dimensional cutting stock algorithm for balanced cutting patterns. Oper. Res. Lett. 14(5) 275-282.
21. Vasko, F. J., M. L. Cregger, K. L. Stott, L. R. Woodyatt. 1994. Assigning slabs to orders - An example of appropriate model formulation. Comput. Indust. Engrg. 26(4) 797-800.
22. Vasko, F. J., D. D. Newhart, K. L. Stott, F. E. Wolf. 1996. Using a facility location algorithm to determine optimum cast bloom lengths. J. Oper. Res. Soc. 47(3) 341-346.
23. Vasko, F. J., J. A. McNamara, R. N. Parkes, F. E. Wolf, L. R. Woodyatt. 2000. A matching approach for replenishing rectangular stock sizes. J. Oper. Res. Soc. 51(3) 253-257.