An efficient approach for large-scale twodimensional guillotine cutting stock problems

Journal of the Operational Research Society

Volumn 49, Issue 12, 1998, Pages 1270-1277

  Fayard, D ^a   Hifi, M ^b   Zissimopoulos, V ^c  

^a CNRS   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

Combinatorial optimisation; Cutting problem; Dynamic programming; Heuristics; Knapsack problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CUTTING; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

KNAPSACK PROBLEMS; LARGE-SCALE TWO-DIMENSIONAL GUILLOTINE CUTTING STOCK PROBLEMS;

DYNAMIC PROGRAMMING;

EID: 0032305430     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600638     Document Type: Article

References (28)

1. Gilmore PC and Gomory RE (1965). Multistage cutting problems of two and more dimensions. Opns Res. 13: 94-119.
2. Gilmore PC and Gomory RE (1966). The theory and computation of knapsack functions. Opns Res 14: 1045-1074.
3. Gilmore PC (1979). Cutting stock, linear programming, knap- sacking, dynamic programming and integer programming, some interconnections. Annals of DisMath 4: 217-235.
4. Kantorovich LK (1960). Mathematical methods of organizing and planning production. Mgm Sci 6: 363-422.
5. Rinnoy Kan AHG, De Wit JR, Wijmenga RT (1987). Nonorthogonal two-dimensional cutting patterns. Mgm Sci 33: 670-684.
6. Beasley JE (1985). Algorithms for unconstrained two-dimensional guillotine cutting. J Opl Res Soc 36: 297-306.
7. Christofides N and Whitlock C (1977). An algorithm for twodimensional cutting problems. Opns Res 2: 31-44.
8. Herz J (1972). A recursive computing procedure for twodimensional stock cutting. IBM J Res and Develop 16: 462-469.
9. Hifi M and Zissimopoulos V (1996). A recursive exact algorithm for weighted two-dimensional cutting. Eur J Opl Res 91: 553-564.
10. Fayard D, Zissimopoulos V (1995). An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Eur J Opl Res 84: 618-632.
11. Hifi M (1994). Study of some combinatorial optimization problems: cutting stock, packing and set covering problems. PhD Thesis. Université Paris 1 Panthéon-Sorbonne, In French.
12. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145-159.
13. Sweeney PE and Paternoster ER (1992). Cutting and packing problems: a categorized applications-oriented research bibliography. J Opl Res Soc 43: 691-706.
14. Zissimopoulos V (1995). Combinatorial optimization: towards adaptive massively parallel algorithms, Habilitation Thesis, LRI, no 1011, France.
15. Christofides N and Hadjiconstantinou E (1995). An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur J Opl Res 83: 21-38.
16. Viswanathan KV and Bagchi A (1993). Best-first search methods for constrained two-dimensional cutting stock problems. Opns Res 41: 768-776.
17. Hifi M (1997). An improvement of Viswanathan and Bagchi’s exact algorithm for cutting stock problems. Comp and Opns Res 24: 727-736.
18. Hifi M and Zissimopoulos V (1997). Constrained two-dimensional cutting: an improvement of Christofides and Whitlock’s exact algorithm. J Opl Res Soc 48: 324-331.
19. Morabito R, Arenales M and Aarcaro V (1992). An and-or- graph approach for two-dimensional cutting problems. Eur J Opl Res 58: 263-271.
20. Morabito R and Arenales M (1996). Staged and constrained two-dimensional guillotine cutting problems: an and/or-graph approach. Eur J Opl Res 94: 548-560.
21. Wang PY (1983). Two algorithms for constrained two-dimensional cutting stock problems. Opns Res 31: 573-586.
22. Oliveira JF and Ferreira JS (1990). An improved version of Wang’s algorithm for two-dimensional cutting problems. Eur J Opl Res 44: 256-266.
23. Vasko FJ (1989). A computational improvement to Wang’s twodimensional cutting stock algorithm. Comp and Indust Enginng 16: 109-115.
24. Lawler EL (1979). Fast approximation algorithms for knapsack problems. Mathe of Opns Res 4: 339-356.
25. Martello S and Toth P (1990). An exact algorithm for large unbounded knapsack problems. Opns Res Lett 9: 15-20.
26. Toth P (1980). Dynamic programming algorithms for zero-one knapsack problem. Computing 25: 29-45.
27. Hifi M and Zissimopoulos V (1996). Une amélioration de l’algorithme récusif de Herz pour le problème de découpe à deux dimensions. RAIRO Opns Res 30: 111-126.
28. Tschöke S and Holthofer N (1996). A new parallel approach to the constrained two-dimensional cutting stock problem. Technical Report, University of Paderborn, D.C.S. 33095 Paderborn. Germany.