Production planning with flexible product specifications: An application to specialty steel manufacturing

Operations Research

Volumn 51, Issue 1, 2003, Pages

  Balakrishnan, Anantaram ^a   Geunes, Joseph ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Industries, mining metals: applied optimization in steel manufacturing; Production scheduling, applications: steel plate production planning; Programming, integer applications: large scale mixed integer optimization

Indexed keywords

INTEGER APPLICATIONS; LARGE-SCALE MIXED INTEGER OPTIMIZATION; REVENUES; SUPPLY;

ALGORITHMS; DATA REDUCTION; IRON AND STEEL INDUSTRY; MATHEMATICAL MODELS; PLANNING; PROBLEM SOLVING; PRODUCTION ENGINEERING; SPECIFICATIONS;

OPERATIONS RESEARCH;

EID: 4243100666     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.1.94.12791     Document Type: Article

References (29)

1. Aardal, K., S. van Hoesel. 1996. Polyhedral techniques in combinatorial optimization I: Theory. Statistica Neerlandica 50 3-26.
2. Balakrishnan, A., S. Brown. 1996. Process planning for aluminum tubes: An engineering-operations perspective. Oper. Res. 44(1) 7-20.
3. _, J. Geunes. 2000. Incorporating order flexibility in production planning: An application to specialty steel manufacturing. Technical report #2000-10, University of Florida, Gainesville, FL.
4. Balas, E. 1975. Facets of the knapsack polytope. Math. Programming 8 146-164.
5. Barcelo, J., J. Casanovas. 1984. A heuristic Lagrangian algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15 212-226.
6. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savels-bergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
7. Coffman, E. G., M. R. Garey, D. S. Johnson. 1984. Approximation algorithms for bin-packing - An updated survey. G. Ausiello, M. Lucertini, P. Serafini, eds. Algorithm Design for Computer Design. Springer-Verlag, New York, 49-106.
8. Crowder, H., E. L. Johnson, M. W. Padberg. 1983. Solving large scale zero-one linear programming problems. Oper. Res. 31 803-834.
9. Dell'Amico, M., F. Maffioli, S. Martello, eds. 1997. Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons, Chichester, U.K.
10. Denizel, M. 2002. Minimization of the number of tool magazine setups on automated machines: A Lagrangean decomposition approach. Working paper SUGSM-02-01, Sabanci University, Istanbul, Turkey.
11. Euromonitor International. 2000. Semi-fabricated steel in the USA. Euromonitor 2000 〈http://www.euromonitor.com〉.
12. Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-8.
13. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York.
14. Geoffrion, A. M. 1974. Lagrangian relaxation for integer programming. Math. Programming Study 2 82-114.
15. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
16. _, _. 1963. A linear programming approach to the cutting stock problem, Part II. Oper. Res. 11 863-888.
17. Hendry, L. C., K. K. Fok, K. W. Shek. 1996. A cutting stock and scheduling problem in the copper industry. J. Oper. Res. Soc. 47 38-47.
18. Kalagnanam, J. R., M. W. Dawande, M. Trumbo, H. S. Lee. 2000. The surplus inventory matching problem in the process industry. Oper. Res. 48(4) 505-516.
19. Klincewicz, J. G., H. Luss. 1986. A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37(5) 495-500.
20. Leung, J., T. L. Magnanti. 1989. Valid inequalities and facets of the capacitated plant location problem. Math. Programming 44 271-291.
21. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
22. Rothenberg, G. B. 1977. Specialty Steels: Recent Developments. Noyes Data Corporation, Park Ridge, NJ.
23. Simchi-Levi, D. 1994. New worst-case results for the bin-packing problem. Naval Res. Logist. 41 579-585.
24. Suarez, F. F., M. A. Cusumano, C. F. Fine. 1996. An empirical study of manufacturing flexibility in printed circuit board assembly. Oper. Res. 44(1) 223-240.
25. Tokuyama, H., N. Ueno. 1985. The cutting stock problem for large sections in the iron and steel industries. Eur. J. Oper. Res. 22 280-292.
26. Van Roy, T. J., L. A. Wolsey. 1986. Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. 14 199-213.
27. Vasko, F. J., M. L. Cregger, K. L. Stott, R. L. Woodyatt. 1994. Assigning slabs to orders: An example of appropriate model formulation. Comput. Indust. Engrg. 26(4) 797-800.
28. Vonderembse, M. A. 1995. Exploring a design decision for a cutting stock problem in the steel industry: All design widths are not created equal. HE Trans. 27 358-367.
29. Wolsey, L. A. 1975. Faces for a linear inequality in 0-1 variables. Math. Programming 8 165-178.