Heuristic methods for solving (un)constrained two-dimensional cutting stock problems. (English) Zbl 0593.90039

Summary: We propose a heuristic method for solving two-dimensional cutting stock problems with unbounded variables (number of pieces of each type to be produced). In the particular case where the function to be maximized is proportional to the area, our solution is \(\epsilon\)-approximative. We also describe a generalization of the method for the case of bounded variables, using 0-1 integer programming. In order to show the efficiency of the algorithm we give large size examples which cannot be treated by actually known methods.


90B30 Production models
90C10 Integer programming
65K05 Numerical mathematical programming methods
90C90 Applications of mathematical programming