A new placement heuristic for the orthogonal stock-cutting problem

Operations Research

Volumn 52, Issue 4, 2004, Pages 655-672

  Burke, E K ^a   Kendall, G ^a   Whitwell, G ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Computers computer science: artificial intelligence; Production scheduling: approximations heuristic; Production scheduling: cutting stock trim

Indexed keywords

ALGORITHMS; AUTOMATION; DATA REDUCTION; HEURISTIC METHODS; INVENTORY CONTROL; LINEAR PROGRAMMING;

APPROXIMATIONS/HEURISTICS; COST SAVINGS; CUTTING STOCK/TRIM; PRODUCTION/SCHEDULING;

PROBLEM SOLVING;

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

References (37)

1. Albano, A., R. Orsini. 1979. A heuristic solution of the rectangular cutting stock problem. Comput. J. 23(4) 338-343.
2. Baker, B. S., E. G. Coffman, Jr., R. L. Rivest. 1980. Orthogonal packings in two dimensions. SIAM J. Comput. 9(4) 808-826.
3. Beasley, J. E. 1985a. An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33(1) 49-64.
4. Beasley, J. E. 1985b. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36(4) 297-306.
5. Bengtsson, B. E. 1982. Packing rectangular pieces - A heuristic approach. Comput. J. 25(3) 353-357.
6. Chazelle, B. 1983. The bottom-left bin packing heuristic: An efficient implementation. IEEE Trans. Comput. 32(8) 697-707.
7. Christofides, N., C. Whitlock. 1977. An algorithm for two-dimensional cutting problems. Oper. Res. 25(1) 30-44.
8. Coffman, E. G., Jr., F. T. Leighton. 1989. A provably efficient algorithm for dynamic storage allocation. J. Comput. System Sci. 38 2-35.
9. Coffman, E. G., Jr., M. R. Garey, D. S. Johnson. 1978. An application of bin packing to multiprocessor scheduling. SIAM Comput. 7 1-17.
10. Coffman, E. G., Jr., 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 Systems Design. Springer-Verlag, New York 49-106.
11. Cung, V. D., M. Hifi, B. Le Cun. 2000. Constrained two-dimensional cutting stock problems - A best-first branch-and-bound algorithm. Internat. Trans. Oper. Res. 7 185-210.
12. Dagli, C. H., A. Hajakbari. 1990. Simulated annealing approach for solving stock cutting problem. Proc. IEEE Internat. Conf. Systems, Man, and Cybernetics. Los Angeles, CA, 221-223.
13. Dagli, C. H., P. Poshyanonda. 1997. New approaches to nesting rectangular patterns. J. Intelligent Manufacturing 3(3) 177-190.
14. Dowsland, K. A., W. B. Dowsland. 1992. Packing problems. Eur. J. Oper. Res. 56 2-14.
15. Dowsland, K. A., W. B. Dowsland. 1995. Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84 506-521.
16. Dyckhoff, H. 1990. A typology of cutting and packing problems. Eur. J. Oper. Res. 44 145-159.
17. Faina, L. 1999. An application of simulated annealing to the cutting stock problem. Eur. J. Oper. Res. 114 542-556.
18. Falkenauer, E. 1996. A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1) 5-30.
19. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, CA.
20. Garey, M. R., D. S. Johnson. 1981. Approximation algorithms for bin packing problems: A survey. D. Ausiello, M. Lucertini, eds. Analysis and Design of Algorithms in Combinatorial Optimization. CISM Courses and Lectures, Vol. 266. Springer Verlag, New York, 147-172.
21. Gilmore, P. C. 1966. The cutting stock problem. IBM Proc. Combinatorial Problems 211-224.
22. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
23. Golden, B. L. 1976. Approaches to the cutting stock problem. AIIE Trans. 8 265-274.
24. Hifi, M., V. Zissimopolous. 1997. Constrained two-dimensional cutting: An improvement of Christofides arid Whitlock's exact algorithm. J. Oper. Res. Soc. 48 324-331.
25. Hopper, E., B. C. H. Turton. 1999. A genetic algorithm for a 2D industrial packing problem. Comput. Indust. Engrg. 37 375-378.
26. Hopper, E., B. C. H. Turton. 2001. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128 34-57.
27. Hower, W., M. Rosendahl, D. Köstner, 1996. Evolutionary algorithm design. Artificial Intelligence in Design '96. Kluwer Academic Publishers, Dordrecht, Germany, 663-680.
28. Jakobs, S. 1996. On genetic algorithms for the packing of polygons, Eur. J. Oper. Res. 88 165-181.
29. Kroger, B. 1995. Guillotineable bin packing: A genetic approach. Eur. J. Oper. Res. 84 645-661.
30. Lai, K. K., J. W. M. Chan. 1996. Developing a simulated annealing algorithm for the cutting stock problem. Comput. Indust. Engrg. 32(1) 115-127.
31. Li, Z., V. Milenkovic. 1995. Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. (Special Issue on Cutting and Packing) 84 539-561.
32. Liu, D., H. Teng. 1999. An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. Eur. J. Oper. Res. 112 413-419.
33. Paull, A. E. 1956. Linear programming: A key to optimum newsprint production. Pulp Paper Magazine Canada 57 85-90.
34. Ramesh Babu, A., N. Ramesh Babu. 1999. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Internat. J. Production Res. 37(7) 1625-1643.
35. Roberts, S. A. 1984. Application of heuristic techniques to the cutting stock problem for worktops. J. Oper. Res. Soc. 35 369-377.
36. Sweeny, P. E., E. R. Paternoster. 1992. Cutting and packing problems: A categorized application-orientated research bibliography. J. Oper. Res. Soc. 43(7) 691-706.
37. Valenzuela, C. L., P. Y. Wang. 2001. Heuristics for large strip packing problems with guillotine patterns: An empirical study. Proc. 4th Metaheuristics Internat. Conf., University of Porto, Porto, Portugal, 417-421.