A heuristic approach to one-dimensional cutting stock problem
Instead of a mathematical programming model that minimizes the scrap in a one-dimensional cutting stock problem, a model that maximizes the utility of the scrap is considered. The model's constraints are linear, the utility function is a nonlinear separable function and the variables are nonnegative integers. A heuristic algorithm using a multistage decision making approach is given to solve the problem.
scientific article; zbMATH DE number 4001849