Large scale production planning in the stainless steel industry

Industrial and Engineering Chemistry Research

Volumn 50, Issue 9, 2011, Pages 4893-4906

  Karelahti, Janne ^a   Vainiomäki, Pekka ^a   Westerlund, Tapio ^b  

^a ACCENTURE   (United States)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ACCENTURE; CUTTING PATTERNS; CUTTING STOCK PROBLEM; DECOMPOSITION TECHNIQUE; FINITE LENGTH; INDUSTRIAL ENVIRONMENTS; LARGE SCALE PRODUCTIONS; NONLINEAR PROBLEMS; NUMERICAL EXAMPLE; NUMERICAL SOLUTION; OUTOKUMPU STAINLESS; PAPER INDUSTRIES; PRODUCTION PLANNING SYSTEMS; SCRAP MATERIALS; TRIM LOSS;

CUTTING; IRON AND STEEL PLANTS; PAPER AND PULP INDUSTRY; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT; STEELMAKING;

STAINLESS STEEL;

EID: 79955544015     PISSN: 08885885     EISSN: 15205045     Source Type: Journal    
DOI: 10.1021/ie101376b     Document Type: Article

References (41)

1. Hinxman, A. The Trim-Loss and Assortment Problems: A Survey Eur. J. Oper. Res. 1980, 5, 8-18
2. Dyckhoff, H. A Typology of Cutting and Packing Problems Eur. J. Oper. Res. 1990, 44, 145-159
3. Kantorovich, L. Mathematical Methods of Organizing and Planning Production Manage. Sci. 1960, 5, 366-422
4. Harjunkoski, I.; Westerlund, T. Enlarging the Trim-Loss Problem to Cover the Raw Paper Mill Comput. Chem. Eng. 1998, 22, S1019-S1022
5. Westerlund, T.; Harjunkoski, I.; Isaksson, J. Solving a Production Optimization Problem in a Paper-Converting Mill with MILP Comput. Chem. Eng. 1998, 22, 563-570 (Pubitemid 128714157)
6. Westerlund, T.; Isaksson, J.; Harjunkoski, I. Solving a two-dimensional trim-loss problem with MILP Eur. J. Oper. Res. 1998, 104, 572-581 (Pubitemid 128392298)
7. Gilmore, P.; Gomory, R. A Linear Programming Approach to a Cutting Stock Problem Oper. Res. 1961, 9, 849-859
8. Gilmore, P.; Gomory, R. A Linear Programming Approach to a Cutting Stock Problem-Part II Oper. Res. 1963, 11, 863-888
9. Haessler, R. A Note On Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm Oper. Res. 1980, 28, 1001-1005
10. Haessler, R. A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem Manage. Sci. 1971, 17, 793-802
11. Haessler, R. Controlling Cutting Pattern Changes in One-Dimensional Trim Problems Oper. Res. 1975, 23, 483-493
12. Haessler, R. Selection and Design of Heuristic Procedures for Solving Roll Trim Problems Manage. Sci. 1988, 34, 1460-1471
13. Coverdale, I.; Wharton, F. An Improved Heuristic Procedure for a Nonlinear Cutting Stock Problem Manage. Sci. 1976, 23, 78-86
14. Goulimis, C. Optimal Solutions for the Cutting Stock Problem Eur. J. Oper. Res. 1990, 44, 197-208 (Pubitemid 20648281)
15. Haessler, R.; Sweeney, P. Cutting Stock Problems and Solution Procedures Eur. J. Oper. Res. 1991, 54, 141-150 (Pubitemid 21729727)
16. Johnston, R. Rounding Algorithms for Cutting Stock Problems J. Asian-Pac. Oper. Res. Soc. 1986, 3, 166-171
17. Suliman, S. M. A. A Sequential Heuristic Procedure for the Two-Dimensional Cutting-Stock Problem Int. J. Prod. Econ. 2006, 99, 177-185 (Pubitemid 41550219)
18. Glover, F. Future Paths for Integer Programming and Links to Artificial Intelligence Comput. Oper. Res. 1986, 13, 533-549 (Pubitemid 17480188)
19. Alvarez-Valdés, R.; Parajón, A.; Tamarit, J. M. A Tabu Search Algorithm for Large-Scale Guillotine (Un)constrained Two-Dimensional Cutting Problems Comput. Oper. Res. 2002, 29, 925-947 (Pubitemid 34135098)
20. Yang, C.-T.; Sun, T.-C.; Weng, W.-C. An Improved Tabu Search Approach with Mixed Objective Function for One-Dimensional Cutting Stock Problems Adv. Eng. Software 2006, 37, 502-513 (Pubitemid 44066803)
21. Feo, T.; Resende, M. Greedy Randomized Adaptive Search Procedures J. Global Optim. 1995, 6, 109-133
22. Wagner, B. A Genetic Algorithm Solution for One-dimensional Bundled Stock Cutting Eur. J. Oper. Res. 1999, 117, 368-381
23. Liang, K.-H.; Yao, X.; Newton, C.; Hoffman, D. A New Evolutionary Approach to Cutting Stock Problems With and Without Contiguity Comput. Oper. Res. 2002, 29, 1641-1659 (Pubitemid 34589743)
24. Östermark, R. Solving a Nonlinear Non-Convex Trim Loss Problem with a Genetic Hybrid Algorithm Comput. Oper. Res. 1999, 26, 623-635 (Pubitemid 29346455)
25. Maniezzo, V.; Carbonaro, A. Ant Colony Optimization: An Overview Knowl. Data Eng. 1999, 11, 769-778
26. Bertsimas, D.; Tsitsiklis, J. Introduction to Linear Optimization; Athena Scientific: Belmont, MA, 1997.
27. Pörn, R.; Harjunkoski, I.; Westerlund, T. Convexification of Different Classes of Non-Convex MINLP Problems Comput. Chem. Eng. 1999, 23, 439-448 (Pubitemid 29179700)
28. Westerlund, T.; Skrifvars, H.; Harjunkoski, I.; Pörn, R. An Extended Cutting Plane Method for a Class of Non-Convex MINLP Problems Comput. Chem. Eng. 1998, 22, 357-365 (Pubitemid 128644781)
29. Still, C.; Westerlund, T. A Sequential Cutting Plane Algorithm for Solving Convex NLP Problems Eur. J. Oper. Res. 2006, 173, 444-464
30. Still, C.; Westerlund, T. Eur. J. Oper. Res., accepted for publication.
31. Goyal, V.; Ierapetritou, M. G. Computational Studies Using a Novel Simplicial- Approximation Based Algorithm forMINLP Optimization Comput. Chem. Eng. 2004, 28, 1771-1780 (Pubitemid 38638297)
32. Gasimov, R. N.; Sipahioglu, A.; Sara, T. A Multi-Objective Programming Approach to 1.5- Dimensional Assortment Problem Eur. J. Oper. Res. 2007, 179, 64-79 (Pubitemid 44809563)
33. Rodríguez, M. A.; Vecchietti, A. Enterprise Optimization for Solving a Assignment and Trim- Loss Non-Convex Problem Comput. Chem. Eng. 2008, 32, 2812-2822
34. Reeves, C. Hybrid Genetic Algorithms for Bin-Packing and Related Problems Ann. Oper. Res. 1996, 63, 371-396
35. Hopper, E.; Turton, B. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems Artif. Intell. Rev. 2001, 16, 257-300 (Pubitemid 33109943)
36. Westerlund, T.; Isaksson, J.; Harjunkoski, I. Solving a Production Optimization Problem in the Paper Industry; Report 95-146-A, 1995.
37. ILOG, CPLEX 7.1 User's Manual, France, 2001.
38. Demir, M. C. A Pattern Generation-Integer Programming Based Formulation for the Carpet Loading Problem Comput. Ind. Eng. 2008, 54, 110-117 (Pubitemid 350102756)
39. Giannelos, N. F.; Georgiadis, M. C. A Model for Scheduling Cutting Operations in Paper-Converting Processes Ind. Eng. Chem. Res. 2001, 40, 5752-5757 (Pubitemid 33089738)
40. Schilling, G.; Georgiadis, M. C. An Algorithm for the Determination of Optimal Cutting Patterns Comput. Oper. Res. 2002, 29, 1041-1058 (Pubitemid 34196080)
41. Westerlund, T.; Isaksson, J. Some Efficient Formulations for the Simultaneous Solution of Trim-Loss and Scheduling Problems in the Paper-Converting Industry Trans. Inst. Chem. Eng. 1998, 76, 677-684 (Pubitemid 29025393)