Developing a Maximum Inscribed Rectangle Heuristic to Satisfy Rush Orders for Heavy Plate Steel

References

• Balakrishnan A, Geunes J (2003) Production planning with flexible product specifications: An application to specialty steel manufacturing. Oper. Res. 51(1):94–112.Link, Google Scholar
• Bengtsson B (1982) Packing rectangular pieces—A heuristic approach. Comput. J. 25(3):353–357.Google Scholar
• Chazelle B (1983) The bottom-left bin-packing heuristic: An efficient implementation. IEEE Trans. Comput. 100(8):697–707.Google Scholar
• Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev. 24:63–79.Google Scholar
• Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper. Res. 25(1):30–44.Link, Google Scholar
• Coffman EG Jr, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9(4):808–826.Google Scholar
• Coppersmith D, Raghavan P (1989) Multidimensional on-line bin packing: Algorithms and worst-case analysis. Oper. Res. Lett. 8(1):17–20.Google Scholar
• Csirik J, van Vliet A (1993) An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13(3):149–158.Google Scholar
• El-Bouri A, Popplewell N, Balakrishnan S, Alfa AS (1994) A search-based heuristic for the two-dimensional bin-packing problem. INFOR Inform. Systerms Oper. Res. 32(4):265–274.Google Scholar
• Epstein L (2003) Two dimensional packing: The power of rotation. Rovan B, Vojtáš P, eds. Mathematical Foundations of Computer Science 2003. Lecture Notes in Computer Science, vol. 2747 (Springer, Berlin), 398–407.Google Scholar
• Epstein L, van Stee R (2004) Optimal online bounded space multidimensional packing. SODA’04 Proc. 15th Annu. ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 214–223.Google Scholar
• Epstein L, van Stee R (2006) This side up! ACM Trans. Algorithms 2(2):228–243.Google Scholar
• Fujita S, Hada T (2002) Two-dimensional on-line bin packing problem with rotatable items. Theoret. Comput. Sci. 289(2):939–952.Google Scholar
• Garey MR, Johnson DS (2002) Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences, vol. 29 (W. H. Freeman & Co., New York).Google Scholar
• Gilmore P, Gomory R (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.Link, Google Scholar
• Kantorovich L (1960) Mathematical methods of organizing and planning production. Management Sci. 6(4):366–422.Link, Google Scholar
• Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11(4):345–357.Link, Google Scholar
• Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Management Sci. 44(3):388–399.Link, Google Scholar
• Seiden SS, van Stee R (2002) New bounds for multi-dimensional packing. Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 486–495.Google Scholar
• Vonderembse M (1984) Selecting master slab width(s) for continuous steel casting. J. Oper. Management 4(3):231–244.Google Scholar
• Vonderembse M, Haessler R (1982) A mathematical programming approach to schedule master slab casters in the steel industry. Management Sci. 28(12):1450–1461.Link, Google Scholar
• Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3):1109–1130.Google Scholar